{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UINJRA5UW3SGOSF2BVZMD5OCFV","short_pith_number":"pith:UINJRA5U","schema_version":"1.0","canonical_sha256":"a21a9883b4b6e46748ba0d72c1f5c22d62b75a192f7d624de6bb2032648c2093","source":{"kind":"arxiv","id":"1406.6429","version":6},"attestation_state":"computed","paper":{"title":"A note on polynomial solvability of the CDT problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Bienstock","submitted_at":"2014-06-25T01:11:31Z","abstract_excerpt":"We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok."},"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":"1406.6429","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-25T01:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"ac70208580486055035bcaff2357937d132f4871ace74e3c3f525f6097436102","abstract_canon_sha256":"5175dbd2aadba45980a7895a1419016c95fb4dfa70b8861c4d0b4ecafb930df2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:39.021615Z","signature_b64":"g+RgtwNhE/4NdpXJvZPteEIq87sd53AGRd/4cfVDT/Wxnp+wiz7sAE0+LuWXRU82GG1qw4D610HYZBfC3DKzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a21a9883b4b6e46748ba0d72c1f5c22d62b75a192f7d624de6bb2032648c2093","last_reissued_at":"2026-05-18T02:26:39.021016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:39.021016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on polynomial solvability of the CDT problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Bienstock","submitted_at":"2014-06-25T01:11:31Z","abstract_excerpt":"We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6429","kind":"arxiv","version":6},"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":"1406.6429","created_at":"2026-05-18T02:26:39.021102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6429v6","created_at":"2026-05-18T02:26:39.021102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6429","created_at":"2026-05-18T02:26:39.021102+00:00"},{"alias_kind":"pith_short_12","alias_value":"UINJRA5UW3SG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UINJRA5UW3SGOSF2","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UINJRA5U","created_at":"2026-05-18T12:28:52.271510+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/UINJRA5UW3SGOSF2BVZMD5OCFV","json":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV.json","graph_json":"https://pith.science/api/pith-number/UINJRA5UW3SGOSF2BVZMD5OCFV/graph.json","events_json":"https://pith.science/api/pith-number/UINJRA5UW3SGOSF2BVZMD5OCFV/events.json","paper":"https://pith.science/paper/UINJRA5U"},"agent_actions":{"view_html":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV","download_json":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV.json","view_paper":"https://pith.science/paper/UINJRA5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6429&json=true","fetch_graph":"https://pith.science/api/pith-number/UINJRA5UW3SGOSF2BVZMD5OCFV/graph.json","fetch_events":"https://pith.science/api/pith-number/UINJRA5UW3SGOSF2BVZMD5OCFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV/action/storage_attestation","attest_author":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV/action/author_attestation","sign_citation":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV/action/citation_signature","submit_replication":"https://pith.science/pith/UINJRA5UW3SGOSF2BVZMD5OCFV/action/replication_record"}},"created_at":"2026-05-18T02:26:39.021102+00:00","updated_at":"2026-05-18T02:26:39.021102+00:00"}