{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OA4HD7PFUM2GQRPBVZLVQNPQMK","short_pith_number":"pith:OA4HD7PF","canonical_record":{"source":{"id":"1409.4977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T12:57:52Z","cross_cats_sorted":[],"title_canon_sha256":"6dd10277c69c25a1e5558c48b1a0c54464a0e93fee0864e640a1fe790008ceac","abstract_canon_sha256":"f6593eb78227e0d1cac9aaccbb006286d81ac4c44495bf4a8daa2f8c374b21df"},"schema_version":"1.0"},"canonical_sha256":"703871fde5a3346845e1ae575835f06288161b1192f29d1f5b49b578840cdf94","source":{"kind":"arxiv","id":"1409.4977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4977","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4977v1","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4977","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"OA4HD7PFUM2G","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OA4HD7PFUM2GQRPB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OA4HD7PF","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OA4HD7PFUM2GQRPBVZLVQNPQMK","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T12:57:52Z","cross_cats_sorted":[],"title_canon_sha256":"6dd10277c69c25a1e5558c48b1a0c54464a0e93fee0864e640a1fe790008ceac","abstract_canon_sha256":"f6593eb78227e0d1cac9aaccbb006286d81ac4c44495bf4a8daa2f8c374b21df"},"schema_version":"1.0"},"canonical_sha256":"703871fde5a3346845e1ae575835f06288161b1192f29d1f5b49b578840cdf94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:38.189028Z","signature_b64":"T/j+TtdrRi6Sh4DsR5SI9X4f+9NsfoCE+qvHbj3AxCo1CUx1RrX1gcI0yEQXJNknXI3RtfG2vq2jT2+fXYQbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"703871fde5a3346845e1ae575835f06288161b1192f29d1f5b49b578840cdf94","last_reissued_at":"2026-05-18T02:42:38.188280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:38.188280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4977","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqmnqQTfbW8BFX/1z5Wp15DekMaaVjYaLRDBUlM4c+f9kvBNHlG31ksyDAZ0jF6odhcheKIjTIGaQKQqeU33Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:13.764811Z"},"content_sha256":"aa93ee458ee73c99d811d8d9403ca6fd89565d7a1a5f5e05eade252dc3f5438d","schema_version":"1.0","event_id":"sha256:aa93ee458ee73c99d811d8d9403ca6fd89565d7a1a5f5e05eade252dc3f5438d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OA4HD7PFUM2GQRPBVZLVQNPQMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank Maximal Matchings -- Structure and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meghana Nasre, Prajakta Nimbhorkar, Pratik Ghoshal","submitted_at":"2014-09-17T12:57:52Z","abstract_excerpt":"Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum number of applicants to their top-rank post, subject to this, the maximum number of applicants to their second rank post and so on.\n  In this paper, we develop a switching graph characterization of rank-maximal matchings, which is a useful tool that encodes all rank-maximal matchings in an instance. The characterization leads to simple and efficient algorithms for several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4977","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWGfyd+vzrPUKCkmdE47SKjVMRe79qeJRu4rUGtS845GoQIg3ogttGCZElWA2j20FIfqZ4avTZylQFqBbI4aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:39:13.765153Z"},"content_sha256":"cb89cf3b922b44e164e527ca420ac040e05b35bc87c2d03ad2e92ae941d03086","schema_version":"1.0","event_id":"sha256:cb89cf3b922b44e164e527ca420ac040e05b35bc87c2d03ad2e92ae941d03086"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK/bundle.json","state_url":"https://pith.science/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T20:39:13Z","links":{"resolver":"https://pith.science/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK","bundle":"https://pith.science/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK/bundle.json","state":"https://pith.science/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OA4HD7PFUM2GQRPBVZLVQNPQMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OA4HD7PFUM2GQRPBVZLVQNPQMK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f6593eb78227e0d1cac9aaccbb006286d81ac4c44495bf4a8daa2f8c374b21df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T12:57:52Z","title_canon_sha256":"6dd10277c69c25a1e5558c48b1a0c54464a0e93fee0864e640a1fe790008ceac"},"schema_version":"1.0","source":{"id":"1409.4977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4977","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4977v1","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4977","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"OA4HD7PFUM2G","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OA4HD7PFUM2GQRPB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OA4HD7PF","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:cb89cf3b922b44e164e527ca420ac040e05b35bc87c2d03ad2e92ae941d03086","target":"graph","created_at":"2026-05-18T02:42:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum number of applicants to their top-rank post, subject to this, the maximum number of applicants to their second rank post and so on.\n  In this paper, we develop a switching graph characterization of rank-maximal matchings, which is a useful tool that encodes all rank-maximal matchings in an instance. The characterization leads to simple and efficient algorithms for several","authors_text":"Meghana Nasre, Prajakta Nimbhorkar, Pratik Ghoshal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T12:57:52Z","title":"Rank Maximal Matchings -- Structure and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4977","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa93ee458ee73c99d811d8d9403ca6fd89565d7a1a5f5e05eade252dc3f5438d","target":"record","created_at":"2026-05-18T02:42:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f6593eb78227e0d1cac9aaccbb006286d81ac4c44495bf4a8daa2f8c374b21df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T12:57:52Z","title_canon_sha256":"6dd10277c69c25a1e5558c48b1a0c54464a0e93fee0864e640a1fe790008ceac"},"schema_version":"1.0","source":{"id":"1409.4977","kind":"arxiv","version":1}},"canonical_sha256":"703871fde5a3346845e1ae575835f06288161b1192f29d1f5b49b578840cdf94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"703871fde5a3346845e1ae575835f06288161b1192f29d1f5b49b578840cdf94","first_computed_at":"2026-05-18T02:42:38.188280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:38.188280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/j+TtdrRi6Sh4DsR5SI9X4f+9NsfoCE+qvHbj3AxCo1CUx1RrX1gcI0yEQXJNknXI3RtfG2vq2jT2+fXYQbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:38.189028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa93ee458ee73c99d811d8d9403ca6fd89565d7a1a5f5e05eade252dc3f5438d","sha256:cb89cf3b922b44e164e527ca420ac040e05b35bc87c2d03ad2e92ae941d03086"],"state_sha256":"ee95cc50fc108f2f55c594830639833db684cf4c62dea3704c258f2c3742c65b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIrzn7DvKPulkdxX1L9eChp4Nb1tYK68D7uhbj81+8BmF4uYI93/9PmR2a+zoBLgX4vQNog1+Nx4Moy928pSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:39:13.767126Z","bundle_sha256":"ad6a0fc15f36a2af8322a90efd0c72bc62d10a5c9da9d4843a1ce4460d426139"}}