{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:T26WR3OX3H4MD42ATREEZW2A5B","short_pith_number":"pith:T26WR3OX","canonical_record":{"source":{"id":"1208.3346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-08-16T11:52:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fa7ea0c8ffe01cb8546830dcebbc78e0c20a4f59ea74ef48c233c87361bfb84f","abstract_canon_sha256":"62621b8c005a600674bd694836e41fd31de1e82873218a66cabdfafab0258290"},"schema_version":"1.0"},"canonical_sha256":"9ebd68edd7d9f8c1f3409c484cdb40e869d5ff84c6fc0ee4c0ed19045e83094c","source":{"kind":"arxiv","id":"1208.3346","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3346","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3346v2","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3346","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"T26WR3OX3H4M","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T26WR3OX3H4MD42A","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T26WR3OX","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:T26WR3OX3H4MD42ATREEZW2A5B","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-08-16T11:52:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fa7ea0c8ffe01cb8546830dcebbc78e0c20a4f59ea74ef48c233c87361bfb84f","abstract_canon_sha256":"62621b8c005a600674bd694836e41fd31de1e82873218a66cabdfafab0258290"},"schema_version":"1.0"},"canonical_sha256":"9ebd68edd7d9f8c1f3409c484cdb40e869d5ff84c6fc0ee4c0ed19045e83094c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:59.034952Z","signature_b64":"CGwKAE2KG1D47zfpiOQndMbuFXk79O0TcCYit40Sh4/0erisN+3RA+won4b/9zRgciADHwVU4fWS/GR4qVY7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ebd68edd7d9f8c1f3409c484cdb40e869d5ff84c6fc0ee4c0ed19045e83094c","last_reissued_at":"2026-05-18T02:37:59.034557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:59.034557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3346","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-18T02:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUZOGPPc8yy/XHDypYHvtHfKRxsVCuk0Pg00Jb2Dkn8MSAsOn2CuLIf4E8oQO7cmvkTtCeYovI3lJa8eAbOoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:57:42.312138Z"},"content_sha256":"50ba608d1bd61107500a04b32581ec1cb78c7b464583c3af8a80a404cb5559fa","schema_version":"1.0","event_id":"sha256:50ba608d1bd61107500a04b32581ec1cb78c7b464583c3af8a80a404cb5559fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:T26WR3OX3H4MD42ATREEZW2A5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Hilbert Refutations for Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Dmitrii Pasechnik, Shmuel Onn, Susan Margulies","submitted_at":"2012-08-16T11:52:54Z","abstract_excerpt":"Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a Hilbert's Nullstellensatz refutation, or certificate, that a given set of integers is not partitionable. We provide an explicit construction of a minimum-degree certificate, and then demonstrate that the Partition problem is equivalent to the determinant of a carefully constructed matrix called the partition matrix. In particular, we show that the determinant o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3346","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-18T02:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0tdmXrK/SgbuRbjcMloUe98BzertjaYtnJsMfWspPpNDUf4C+m8gQtEzPfNP0BAqm2s4bYgD61yxhCWVZECAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:57:42.312519Z"},"content_sha256":"0a7ccae86d5042aafbd9d6a6e6373978a777d85f6f6957429e1d5faadece2804","schema_version":"1.0","event_id":"sha256:0a7ccae86d5042aafbd9d6a6e6373978a777d85f6f6957429e1d5faadece2804"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/bundle.json","state_url":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T26WR3OX3H4MD42ATREEZW2A5B/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-01T17:57:42Z","links":{"resolver":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B","bundle":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/bundle.json","state":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T26WR3OX3H4MD42ATREEZW2A5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:T26WR3OX3H4MD42ATREEZW2A5B","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":"62621b8c005a600674bd694836e41fd31de1e82873218a66cabdfafab0258290","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-08-16T11:52:54Z","title_canon_sha256":"fa7ea0c8ffe01cb8546830dcebbc78e0c20a4f59ea74ef48c233c87361bfb84f"},"schema_version":"1.0","source":{"id":"1208.3346","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3346","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3346v2","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3346","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"T26WR3OX3H4M","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T26WR3OX3H4MD42A","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T26WR3OX","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:0a7ccae86d5042aafbd9d6a6e6373978a777d85f6f6957429e1d5faadece2804","target":"graph","created_at":"2026-05-18T02:37:59Z","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":"Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a Hilbert's Nullstellensatz refutation, or certificate, that a given set of integers is not partitionable. We provide an explicit construction of a minimum-degree certificate, and then demonstrate that the Partition problem is equivalent to the determinant of a carefully constructed matrix called the partition matrix. In particular, we show that the determinant o","authors_text":"Dmitrii Pasechnik, Shmuel Onn, Susan Margulies","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-08-16T11:52:54Z","title":"On the Complexity of Hilbert Refutations for Partition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3346","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:50ba608d1bd61107500a04b32581ec1cb78c7b464583c3af8a80a404cb5559fa","target":"record","created_at":"2026-05-18T02:37:59Z","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":"62621b8c005a600674bd694836e41fd31de1e82873218a66cabdfafab0258290","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-08-16T11:52:54Z","title_canon_sha256":"fa7ea0c8ffe01cb8546830dcebbc78e0c20a4f59ea74ef48c233c87361bfb84f"},"schema_version":"1.0","source":{"id":"1208.3346","kind":"arxiv","version":2}},"canonical_sha256":"9ebd68edd7d9f8c1f3409c484cdb40e869d5ff84c6fc0ee4c0ed19045e83094c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ebd68edd7d9f8c1f3409c484cdb40e869d5ff84c6fc0ee4c0ed19045e83094c","first_computed_at":"2026-05-18T02:37:59.034557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:59.034557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGwKAE2KG1D47zfpiOQndMbuFXk79O0TcCYit40Sh4/0erisN+3RA+won4b/9zRgciADHwVU4fWS/GR4qVY7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:59.034952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3346","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50ba608d1bd61107500a04b32581ec1cb78c7b464583c3af8a80a404cb5559fa","sha256:0a7ccae86d5042aafbd9d6a6e6373978a777d85f6f6957429e1d5faadece2804"],"state_sha256":"830bc814426464e922ce528d08dcb484dd2b9982dfce56ed8118f4dae943375b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXJJaOqo/6cvDOsejvK+iOWgLUg5F4c9pALZtpsuNhPtGP/93vshx6/o57BCe82sm2pdWL2MDPC9kBklCWYCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:57:42.314661Z","bundle_sha256":"74c012035ee45be03a49ed4f7ee17e4d42372f64905eaddc31192024349b3226"}}