{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:T26WR3OX3H4MD42ATREEZW2A5B","short_pith_number":"pith:T26WR3OX","schema_version":"1.0","canonical_sha256":"9ebd68edd7d9f8c1f3409c484cdb40e869d5ff84c6fc0ee4c0ed19045e83094c","source":{"kind":"arxiv","id":"1208.3346","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.3346","created_at":"2026-05-18T02:37:59.034610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3346v2","created_at":"2026-05-18T02:37:59.034610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3346","created_at":"2026-05-18T02:37:59.034610+00:00"},{"alias_kind":"pith_short_12","alias_value":"T26WR3OX3H4M","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"T26WR3OX3H4MD42A","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"T26WR3OX","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B","json":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B.json","graph_json":"https://pith.science/api/pith-number/T26WR3OX3H4MD42ATREEZW2A5B/graph.json","events_json":"https://pith.science/api/pith-number/T26WR3OX3H4MD42ATREEZW2A5B/events.json","paper":"https://pith.science/paper/T26WR3OX"},"agent_actions":{"view_html":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B","download_json":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B.json","view_paper":"https://pith.science/paper/T26WR3OX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3346&json=true","fetch_graph":"https://pith.science/api/pith-number/T26WR3OX3H4MD42ATREEZW2A5B/graph.json","fetch_events":"https://pith.science/api/pith-number/T26WR3OX3H4MD42ATREEZW2A5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/action/storage_attestation","attest_author":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/action/author_attestation","sign_citation":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/action/citation_signature","submit_replication":"https://pith.science/pith/T26WR3OX3H4MD42ATREEZW2A5B/action/replication_record"}},"created_at":"2026-05-18T02:37:59.034610+00:00","updated_at":"2026-05-18T02:37:59.034610+00:00"}