{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:OZ5KUZCDIWDNGHT3PYPBEYGNF7","short_pith_number":"pith:OZ5KUZCD","canonical_record":{"source":{"id":"cond-mat/0310317","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2003-10-14T19:30:30Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"950cca1772ee6b0d329ac22c42679814a9bc7e37951264e809df5ff4280a0b57","abstract_canon_sha256":"2c340dfd338eb38ec8936046d4bed786441c53969273ffc61d45ce518b12bc0d"},"schema_version":"1.0"},"canonical_sha256":"767aaa64434586d31e7b7e1e1260cd2fc906e027abd9f1d2786fb47c2b730e9a","source":{"kind":"arxiv","id":"cond-mat/0310317","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0310317","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0310317v2","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0310317","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"pith_short_12","alias_value":"OZ5KUZCDIWDN","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"pith_short_16","alias_value":"OZ5KUZCDIWDNGHT3","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"pith_short_8","alias_value":"OZ5KUZCD","created_at":"2026-07-04T14:20:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:OZ5KUZCDIWDNGHT3PYPBEYGNF7","target":"record","payload":{"canonical_record":{"source":{"id":"cond-mat/0310317","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2003-10-14T19:30:30Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"950cca1772ee6b0d329ac22c42679814a9bc7e37951264e809df5ff4280a0b57","abstract_canon_sha256":"2c340dfd338eb38ec8936046d4bed786441c53969273ffc61d45ce518b12bc0d"},"schema_version":"1.0"},"canonical_sha256":"767aaa64434586d31e7b7e1e1260cd2fc906e027abd9f1d2786fb47c2b730e9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:20:34.302755Z","signature_b64":"XjLd27Mprr2YRETbCjwLPHkfl7Dt/1GIvOD+D2bHsqkdFDh8tL74ctis8TYxTKK2zB44Vh9ELvkHdxHr24gRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"767aaa64434586d31e7b7e1e1260cd2fc906e027abd9f1d2786fb47c2b730e9a","last_reissued_at":"2026-07-04T14:20:34.302277Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:20:34.302277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cond-mat/0310317","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-07-04T14:20:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+azQEZWh8OCG3vewTL9lLDKbFUwtukf/UUd9MA7CVFWi42RHWEgieF5wyLfcFyHMkCJ/5eJxrEevz/ns3V7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T04:37:30.720703Z"},"content_sha256":"86cbc170343ef8ed8731a59ab942e2c6b87b413b1da5bfe2a46eee1857478e04","schema_version":"1.0","event_id":"sha256:86cbc170343ef8ed8731a59ab942e2c6b87b413b1da5bfe2a46eee1857478e04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:OZ5KUZCDIWDNGHT3PYPBEYGNF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Easiest Hard Problem: Number Partitioning","license":"","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Stephan Mertens","submitted_at":"2003-10-14T19:30:30Z","abstract_excerpt":"Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an \"easy-hard\" phase transition similar to the phase transitions observed in other combinatorial problems like $k$-SAT. In contrast to most other problems, number partitioning is simple enough to obtain detailled and rigorous results on the \"hard\" and \"easy\" phase and the transition that separates them. We review the known results on random integer partitioning, give a very simple d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0310317","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cond-mat/0310317/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:20:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNdyXVP228V8MMktyxsXK3hOwsjLBRZ5cNQQkTU9K6dozwgQO1He924DgialULpHb57falvnymcznuZew433Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T04:37:30.721208Z"},"content_sha256":"496a72dd372af1f7621d7d75172f2cc5cfdbcaf2f4ccd585b21a80d7d0f65d58","schema_version":"1.0","event_id":"sha256:496a72dd372af1f7621d7d75172f2cc5cfdbcaf2f4ccd585b21a80d7d0f65d58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7/bundle.json","state_url":"https://pith.science/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7/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-08-03T04:37:30Z","links":{"resolver":"https://pith.science/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7","bundle":"https://pith.science/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7/bundle.json","state":"https://pith.science/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZ5KUZCDIWDNGHT3PYPBEYGNF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:OZ5KUZCDIWDNGHT3PYPBEYGNF7","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":"2c340dfd338eb38ec8936046d4bed786441c53969273ffc61d45ce518b12bc0d","cross_cats_sorted":["cond-mat.stat-mech"],"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2003-10-14T19:30:30Z","title_canon_sha256":"950cca1772ee6b0d329ac22c42679814a9bc7e37951264e809df5ff4280a0b57"},"schema_version":"1.0","source":{"id":"cond-mat/0310317","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0310317","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0310317v2","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0310317","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"pith_short_12","alias_value":"OZ5KUZCDIWDN","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"pith_short_16","alias_value":"OZ5KUZCDIWDNGHT3","created_at":"2026-07-04T14:20:34Z"},{"alias_kind":"pith_short_8","alias_value":"OZ5KUZCD","created_at":"2026-07-04T14:20:34Z"}],"graph_snapshots":[{"event_id":"sha256:496a72dd372af1f7621d7d75172f2cc5cfdbcaf2f4ccd585b21a80d7d0f65d58","target":"graph","created_at":"2026-07-04T14:20:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cond-mat/0310317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an \"easy-hard\" phase transition similar to the phase transitions observed in other combinatorial problems like $k$-SAT. In contrast to most other problems, number partitioning is simple enough to obtain detailled and rigorous results on the \"hard\" and \"easy\" phase and the transition that separates them. We review the known results on random integer partitioning, give a very simple d","authors_text":"Stephan Mertens","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2003-10-14T19:30:30Z","title":"The Easiest Hard Problem: Number Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0310317","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:86cbc170343ef8ed8731a59ab942e2c6b87b413b1da5bfe2a46eee1857478e04","target":"record","created_at":"2026-07-04T14:20:34Z","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":"2c340dfd338eb38ec8936046d4bed786441c53969273ffc61d45ce518b12bc0d","cross_cats_sorted":["cond-mat.stat-mech"],"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2003-10-14T19:30:30Z","title_canon_sha256":"950cca1772ee6b0d329ac22c42679814a9bc7e37951264e809df5ff4280a0b57"},"schema_version":"1.0","source":{"id":"cond-mat/0310317","kind":"arxiv","version":2}},"canonical_sha256":"767aaa64434586d31e7b7e1e1260cd2fc906e027abd9f1d2786fb47c2b730e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767aaa64434586d31e7b7e1e1260cd2fc906e027abd9f1d2786fb47c2b730e9a","first_computed_at":"2026-07-04T14:20:34.302277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:20:34.302277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XjLd27Mprr2YRETbCjwLPHkfl7Dt/1GIvOD+D2bHsqkdFDh8tL74ctis8TYxTKK2zB44Vh9ELvkHdxHr24gRAg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:20:34.302755Z","signed_message":"canonical_sha256_bytes"},"source_id":"cond-mat/0310317","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86cbc170343ef8ed8731a59ab942e2c6b87b413b1da5bfe2a46eee1857478e04","sha256:496a72dd372af1f7621d7d75172f2cc5cfdbcaf2f4ccd585b21a80d7d0f65d58"],"state_sha256":"98a10fe3640d93de8916605a93a343c6601f77af8b1200bb476bfb7a664d4811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"328y298C0RwyR338vyxXyVQq+DTBe4Iz6kv7xG5B3JitnJMufMImsaKzFMjTUn5Tb27c/T7uDOB1HZfwdnKBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T04:37:30.726530Z","bundle_sha256":"f9b168f9838b5c469a26b8e0de9f50114bfe2e15b06b8e4182b18b83797168b3"}}