{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3RMBUH76TXCPEEAVR3GQM673MR","short_pith_number":"pith:3RMBUH76","canonical_record":{"source":{"id":"1008.0390","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-02T19:58:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"477a5092dcd7b846b546c7e210c5249d95f6e3d0263c75ec47a8a1b9e7a21389","abstract_canon_sha256":"3dea85cefe457899457cdd3895b1842df0727f04223bb4b4e682d35f8ae4ec18"},"schema_version":"1.0"},"canonical_sha256":"dc581a1ffe9dc4f210158ecd067bfb646a91535682c48c8317bfc4911b753f2d","source":{"kind":"arxiv","id":"1008.0390","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0390","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0390v3","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0390","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"3RMBUH76TXCP","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3RMBUH76TXCPEEAV","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3RMBUH76","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3RMBUH76TXCPEEAVR3GQM673MR","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0390","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-02T19:58:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"477a5092dcd7b846b546c7e210c5249d95f6e3d0263c75ec47a8a1b9e7a21389","abstract_canon_sha256":"3dea85cefe457899457cdd3895b1842df0727f04223bb4b4e682d35f8ae4ec18"},"schema_version":"1.0"},"canonical_sha256":"dc581a1ffe9dc4f210158ecd067bfb646a91535682c48c8317bfc4911b753f2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:09.965273Z","signature_b64":"UNmtvCd/6jXtrtxBcsen2mqmd31kCbn/0MBYHHbs3KvEJfHNI7TgAAr4BbEkFkLmCNdrn/89xLZ2iojhxDKvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc581a1ffe9dc4f210158ecd067bfb646a91535682c48c8317bfc4911b753f2d","last_reissued_at":"2026-05-18T03:11:09.964354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:09.964354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0390","source_version":3,"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:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekcxQlHCHQ5yrr3+Dofs5NFXKl2mQIdNkJVzT1Q3KpsO7/QbDOiTmukD6oXPLY97RzGaajXneWJbHGGUkBUkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:37:04.085853Z"},"content_sha256":"cb04247e901e23a6db7ec4f03dc86d558bdb733273ae1ea39314b74d98546479","schema_version":"1.0","event_id":"sha256:cb04247e901e23a6db7ec4f03dc86d558bdb733273ae1ea39314b74d98546479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3RMBUH76TXCPEEAVR3GQM673MR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithms for three-dimensional axial and planar random assignment problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Gregory Sorkin","submitted_at":"2010-08-02T19:58:07Z","abstract_excerpt":"Beautiful formulas are known for the expected cost of random two-dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural \"Axial\" and \"Planar\" versions, both of which are NP-hard. For 3-dimensional Axial random assignment instances of size $n$, the cost scales as $\\Omega(1/n)$, and a main result of the present paper is a linear-time algorithm that, with high probability, finds a solution of cost $O(n^{-1+o(1)})$. For 3-dimensional Planar assignment, the lower bound is $\\Omega(n)$, and we give a new efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0390","kind":"arxiv","version":3},"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:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aE83MrWZktPwjBGsuA2bmi/0lzBZX2Evu8idED9OBhrwGJmoxbO1pOj5U1lRei7BxE6AxnHEToDCGn7xQVFVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:37:04.086192Z"},"content_sha256":"6ebc3edc5a78f2f4b804c838226a6029ac09c1086ac707cedfd1e01e1a3cb749","schema_version":"1.0","event_id":"sha256:6ebc3edc5a78f2f4b804c838226a6029ac09c1086ac707cedfd1e01e1a3cb749"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RMBUH76TXCPEEAVR3GQM673MR/bundle.json","state_url":"https://pith.science/pith/3RMBUH76TXCPEEAVR3GQM673MR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RMBUH76TXCPEEAVR3GQM673MR/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-03T05:37:04Z","links":{"resolver":"https://pith.science/pith/3RMBUH76TXCPEEAVR3GQM673MR","bundle":"https://pith.science/pith/3RMBUH76TXCPEEAVR3GQM673MR/bundle.json","state":"https://pith.science/pith/3RMBUH76TXCPEEAVR3GQM673MR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RMBUH76TXCPEEAVR3GQM673MR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3RMBUH76TXCPEEAVR3GQM673MR","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":"3dea85cefe457899457cdd3895b1842df0727f04223bb4b4e682d35f8ae4ec18","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-02T19:58:07Z","title_canon_sha256":"477a5092dcd7b846b546c7e210c5249d95f6e3d0263c75ec47a8a1b9e7a21389"},"schema_version":"1.0","source":{"id":"1008.0390","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0390","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0390v3","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0390","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"3RMBUH76TXCP","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3RMBUH76TXCPEEAV","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3RMBUH76","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:6ebc3edc5a78f2f4b804c838226a6029ac09c1086ac707cedfd1e01e1a3cb749","target":"graph","created_at":"2026-05-18T03:11:09Z","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":"Beautiful formulas are known for the expected cost of random two-dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural \"Axial\" and \"Planar\" versions, both of which are NP-hard. For 3-dimensional Axial random assignment instances of size $n$, the cost scales as $\\Omega(1/n)$, and a main result of the present paper is a linear-time algorithm that, with high probability, finds a solution of cost $O(n^{-1+o(1)})$. For 3-dimensional Planar assignment, the lower bound is $\\Omega(n)$, and we give a new efficient","authors_text":"Alan Frieze, Gregory Sorkin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-02T19:58:07Z","title":"Efficient algorithms for three-dimensional axial and planar random assignment problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0390","kind":"arxiv","version":3},"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:cb04247e901e23a6db7ec4f03dc86d558bdb733273ae1ea39314b74d98546479","target":"record","created_at":"2026-05-18T03:11:09Z","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":"3dea85cefe457899457cdd3895b1842df0727f04223bb4b4e682d35f8ae4ec18","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-02T19:58:07Z","title_canon_sha256":"477a5092dcd7b846b546c7e210c5249d95f6e3d0263c75ec47a8a1b9e7a21389"},"schema_version":"1.0","source":{"id":"1008.0390","kind":"arxiv","version":3}},"canonical_sha256":"dc581a1ffe9dc4f210158ecd067bfb646a91535682c48c8317bfc4911b753f2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc581a1ffe9dc4f210158ecd067bfb646a91535682c48c8317bfc4911b753f2d","first_computed_at":"2026-05-18T03:11:09.964354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:09.964354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UNmtvCd/6jXtrtxBcsen2mqmd31kCbn/0MBYHHbs3KvEJfHNI7TgAAr4BbEkFkLmCNdrn/89xLZ2iojhxDKvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:09.965273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0390","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb04247e901e23a6db7ec4f03dc86d558bdb733273ae1ea39314b74d98546479","sha256:6ebc3edc5a78f2f4b804c838226a6029ac09c1086ac707cedfd1e01e1a3cb749"],"state_sha256":"86b09779d1fbe834ee67a319764bcf8c09125f3c5fe77f6b9f707cc6709c7945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3DOom4JqJhkdSRJXVRO3s2/ZqZnHIAbo74YHhPugQSe5Z0BAD/BXVCOPKHRz1EJK0ALF0v3JUnSPqEWuQMoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:37:04.088050Z","bundle_sha256":"805da26c9e1d27811a39bfa2d3589bc109085aaae1a7489aaf279f33696f14d1"}}