{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QVMXTQCOFD6WNFIGGL5TENA3ND","short_pith_number":"pith:QVMXTQCO","canonical_record":{"source":{"id":"1007.2170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-07-13T18:18:32Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"0e5d2bfa2198a7d6a6de65415cabd3829c0f03f1797f559437ffe130c2e58e9d","abstract_canon_sha256":"551f5833308be1d13e4bc3424b19e6d42c9e49f5331e48d8e5acc5810fea287f"},"schema_version":"1.0"},"canonical_sha256":"855979c04e28fd66950632fb32341b68c2ffee3405792c2371941e500713f39e","source":{"kind":"arxiv","id":"1007.2170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2170","created_at":"2026-05-18T04:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2170v2","created_at":"2026-05-18T04:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2170","created_at":"2026-05-18T04:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"QVMXTQCOFD6W","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QVMXTQCOFD6WNFIG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QVMXTQCO","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QVMXTQCOFD6WNFIGGL5TENA3ND","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-07-13T18:18:32Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"0e5d2bfa2198a7d6a6de65415cabd3829c0f03f1797f559437ffe130c2e58e9d","abstract_canon_sha256":"551f5833308be1d13e4bc3424b19e6d42c9e49f5331e48d8e5acc5810fea287f"},"schema_version":"1.0"},"canonical_sha256":"855979c04e28fd66950632fb32341b68c2ffee3405792c2371941e500713f39e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:19.541735Z","signature_b64":"Ff4mJZPyU4NFwNFcLr5B/aYWtItsZpb7AxTxYWMLt4ikIBECkUf8XZLUhI+nY84DHF/DiUVRavj2Q3V+cDh4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855979c04e28fd66950632fb32341b68c2ffee3405792c2371941e500713f39e","last_reissued_at":"2026-05-18T04:03:19.541100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:19.541100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2170","source_version":2,"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-18T04:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1IsonjoFPKwtz2Qo+r2QjoELlB2v1VAG0kDT/7D9s+yJBe7Nh+U3Z55tF+/4BOU+bSAb7pHBy+K0avvv3Z3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:07.260052Z"},"content_sha256":"2266375629b4f99039f9fdafc7a25498865eea51617b08cafb67b4b4e0cfab32","schema_version":"1.0","event_id":"sha256:2266375629b4f99039f9fdafc7a25498865eea51617b08cafb67b4b4e0cfab32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QVMXTQCOFD6WNFIGGL5TENA3ND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bin Packing via Discrepancy of Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DM","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Friedrich Eisenbrand, Thomas Rothvo{\\ss}","submitted_at":"2010-07-13T18:18:32Z","abstract_excerpt":"A well studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxation for this problem into an integral solution that requires at most O(log n) additional bins.\n  The three-permutations-problem of Beck is the following. Given any 3 permutations on n symbols, color the symbols red and blue, such that in any interval of any of those permutations, the number of red and blue symbols is roughly the same. The nece"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2170","kind":"arxiv","version":2},"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-18T04:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCDxx97ZV5J1latMkJoIxzXWAjR4lcowfb8DtpOYNnXPYkeaXNYJ4oE7wihkCgp7nUXv8d/tM1ssU046i/M1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:28:07.260418Z"},"content_sha256":"636ac0d579b6c6df2960016113b663ed5008c039fc95879e21f8aa28017b4ed1","schema_version":"1.0","event_id":"sha256:636ac0d579b6c6df2960016113b663ed5008c039fc95879e21f8aa28017b4ed1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVMXTQCOFD6WNFIGGL5TENA3ND/bundle.json","state_url":"https://pith.science/pith/QVMXTQCOFD6WNFIGGL5TENA3ND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVMXTQCOFD6WNFIGGL5TENA3ND/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-03T06:28:07Z","links":{"resolver":"https://pith.science/pith/QVMXTQCOFD6WNFIGGL5TENA3ND","bundle":"https://pith.science/pith/QVMXTQCOFD6WNFIGGL5TENA3ND/bundle.json","state":"https://pith.science/pith/QVMXTQCOFD6WNFIGGL5TENA3ND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVMXTQCOFD6WNFIGGL5TENA3ND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QVMXTQCOFD6WNFIGGL5TENA3ND","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":"551f5833308be1d13e4bc3424b19e6d42c9e49f5331e48d8e5acc5810fea287f","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-07-13T18:18:32Z","title_canon_sha256":"0e5d2bfa2198a7d6a6de65415cabd3829c0f03f1797f559437ffe130c2e58e9d"},"schema_version":"1.0","source":{"id":"1007.2170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2170","created_at":"2026-05-18T04:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2170v2","created_at":"2026-05-18T04:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2170","created_at":"2026-05-18T04:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"QVMXTQCOFD6W","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QVMXTQCOFD6WNFIG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QVMXTQCO","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:636ac0d579b6c6df2960016113b663ed5008c039fc95879e21f8aa28017b4ed1","target":"graph","created_at":"2026-05-18T04:03:19Z","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":"A well studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxation for this problem into an integral solution that requires at most O(log n) additional bins.\n  The three-permutations-problem of Beck is the following. Given any 3 permutations on n symbols, color the symbols red and blue, such that in any interval of any of those permutations, the number of red and blue symbols is roughly the same. The nece","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Friedrich Eisenbrand, Thomas Rothvo{\\ss}","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-07-13T18:18:32Z","title":"Bin Packing via Discrepancy of Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2170","kind":"arxiv","version":2},"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:2266375629b4f99039f9fdafc7a25498865eea51617b08cafb67b4b4e0cfab32","target":"record","created_at":"2026-05-18T04:03:19Z","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":"551f5833308be1d13e4bc3424b19e6d42c9e49f5331e48d8e5acc5810fea287f","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-07-13T18:18:32Z","title_canon_sha256":"0e5d2bfa2198a7d6a6de65415cabd3829c0f03f1797f559437ffe130c2e58e9d"},"schema_version":"1.0","source":{"id":"1007.2170","kind":"arxiv","version":2}},"canonical_sha256":"855979c04e28fd66950632fb32341b68c2ffee3405792c2371941e500713f39e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"855979c04e28fd66950632fb32341b68c2ffee3405792c2371941e500713f39e","first_computed_at":"2026-05-18T04:03:19.541100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:19.541100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ff4mJZPyU4NFwNFcLr5B/aYWtItsZpb7AxTxYWMLt4ikIBECkUf8XZLUhI+nY84DHF/DiUVRavj2Q3V+cDh4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:19.541735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2266375629b4f99039f9fdafc7a25498865eea51617b08cafb67b4b4e0cfab32","sha256:636ac0d579b6c6df2960016113b663ed5008c039fc95879e21f8aa28017b4ed1"],"state_sha256":"3cce7aaf54abf44c8db3455054d71159c66aabd30552897efa1a44bce36640cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EHHLqXpg7Dk+5HqS/aqQ9OGdHWt5kGTOodrZbOIzpmgeP8CaF9+O9utyk1ZppChsEiKoDARf0DfRB2FVmRTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:28:07.262402Z","bundle_sha256":"290f6b3091bf092ccc01afbe6fd5154ffb3da7c03375a587bab541fe499ec57c"}}