{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A6RXLR3Q7CDQI62K5JTC2R2UL3","short_pith_number":"pith:A6RXLR3Q","canonical_record":{"source":{"id":"1301.0902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-05T13:24:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"866d65436feb2e64f378ec7b6b273be0d32649f89317570546c6688607bb1cac","abstract_canon_sha256":"7b3e6fec555c288b99a753a150878d479cd3c17d6f7afbd91d51ab323d17c0bd"},"schema_version":"1.0"},"canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","source":{"kind":"arxiv","id":"1301.0902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0902","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0902v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0902","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"A6RXLR3Q7CDQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A6RXLR3Q7CDQI62K","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A6RXLR3Q","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A6RXLR3Q7CDQI62K5JTC2R2UL3","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-05T13:24:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"866d65436feb2e64f378ec7b6b273be0d32649f89317570546c6688607bb1cac","abstract_canon_sha256":"7b3e6fec555c288b99a753a150878d479cd3c17d6f7afbd91d51ab323d17c0bd"},"schema_version":"1.0"},"canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.436602Z","signature_b64":"o1sr9euoxRYfX99PJtXULj9tRrlw0O9gzRdTCLMtYVaNpunvefFybZlyYyM18rQIJLrH/Fegy+BY6hVugQNOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","last_reissued_at":"2026-05-18T03:37:07.435818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.435818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0902","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rImSur98bjaUCpW3oy65GHUwIYo1nTmvXJbVbpYmht9NJCN2AWUSz95v/ujmEzjIAzpKQvXYa/ez8ARocepCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:02:55.384023Z"},"content_sha256":"50484abcbe6079172c25ae72864291ade88c5bf6cc6a8600cf14d5d72695c9be","schema_version":"1.0","event_id":"sha256:50484abcbe6079172c25ae72864291ade88c5bf6cc6a8600cf14d5d72695c9be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A6RXLR3Q7CDQI62K5JTC2R2UL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Popular Matchings -- structure and cheating strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Meghana Nasre","submitted_at":"2013-01-05T13:24:58Z","abstract_excerpt":"We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges in E are ranked. Each agent ranks a subset of posts in an order of preference, possibly involving ties. A matching M is popular if there exists no matching M' such that the number of agents that prefer M' to M exceeds the number of agents that prefer M to M'. Consider a centralized market where agents submit their preferences and a central authority matches "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0902","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6AmqVRaSO192OtUrcRCRNdh7VDIGZdJ1vb5wpOp0lnNEhZ4m5+INWgvhBsWtzzdPsOBsGQZyuLSMs6FJtp7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:02:55.384380Z"},"content_sha256":"7f98b774c67abc49a0e086c590446dff53a31f61c4e1aed517e102126a3faa44","schema_version":"1.0","event_id":"sha256:7f98b774c67abc49a0e086c590446dff53a31f61c4e1aed517e102126a3faa44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/bundle.json","state_url":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/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-25T02:02:55Z","links":{"resolver":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3","bundle":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/bundle.json","state":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A6RXLR3Q7CDQI62K5JTC2R2UL3","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":"7b3e6fec555c288b99a753a150878d479cd3c17d6f7afbd91d51ab323d17c0bd","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-05T13:24:58Z","title_canon_sha256":"866d65436feb2e64f378ec7b6b273be0d32649f89317570546c6688607bb1cac"},"schema_version":"1.0","source":{"id":"1301.0902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0902","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0902v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0902","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"A6RXLR3Q7CDQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A6RXLR3Q7CDQI62K","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A6RXLR3Q","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:7f98b774c67abc49a0e086c590446dff53a31f61c4e1aed517e102126a3faa44","target":"graph","created_at":"2026-05-18T03:37:07Z","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":"We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges in E are ranked. Each agent ranks a subset of posts in an order of preference, possibly involving ties. A matching M is popular if there exists no matching M' such that the number of agents that prefer M' to M exceeds the number of agents that prefer M to M'. Consider a centralized market where agents submit their preferences and a central authority matches ","authors_text":"Meghana Nasre","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-05T13:24:58Z","title":"Popular Matchings -- structure and cheating strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0902","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:50484abcbe6079172c25ae72864291ade88c5bf6cc6a8600cf14d5d72695c9be","target":"record","created_at":"2026-05-18T03:37:07Z","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":"7b3e6fec555c288b99a753a150878d479cd3c17d6f7afbd91d51ab323d17c0bd","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-05T13:24:58Z","title_canon_sha256":"866d65436feb2e64f378ec7b6b273be0d32649f89317570546c6688607bb1cac"},"schema_version":"1.0","source":{"id":"1301.0902","kind":"arxiv","version":1}},"canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","first_computed_at":"2026-05-18T03:37:07.435818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:07.435818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o1sr9euoxRYfX99PJtXULj9tRrlw0O9gzRdTCLMtYVaNpunvefFybZlyYyM18rQIJLrH/Fegy+BY6hVugQNOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:07.436602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50484abcbe6079172c25ae72864291ade88c5bf6cc6a8600cf14d5d72695c9be","sha256:7f98b774c67abc49a0e086c590446dff53a31f61c4e1aed517e102126a3faa44"],"state_sha256":"6853ad6248d16d774cf80c69554648b2dc9e0515a3e6643d567ca511b2058af3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"byQcmE8yGR7KE7SGgouEKAAa/tVxqtLgWUZKVaTWnOI2Led111zfuR22VVNbjZvv44OodBc24WHBPYU1VFrCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:02:55.386273Z","bundle_sha256":"ef9500b96b8a6fb80fba09040b88873c2bbddc8303c509d6c215b7ad88e3e04d"}}