{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YP55UK3LQR22DPULA7UW22VFJP","short_pith_number":"pith:YP55UK3L","canonical_record":{"source":{"id":"1501.00665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T11:04:09Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"223aa970a933723145bf97e99cc994aac97bf31ab27bfa33f580904c25850479","abstract_canon_sha256":"e0bdae192547ad60007c4617ed97e5f475f719ea9f613d3bba5f68804ef5599c"},"schema_version":"1.0"},"canonical_sha256":"c3fbda2b6b8475a1be8b07e96d6aa54bc873dc2b62e6952631f1b93ba7ae8819","source":{"kind":"arxiv","id":"1501.00665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00665","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00665v1","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00665","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"YP55UK3LQR22","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YP55UK3LQR22DPUL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YP55UK3L","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YP55UK3LQR22DPULA7UW22VFJP","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T11:04:09Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"223aa970a933723145bf97e99cc994aac97bf31ab27bfa33f580904c25850479","abstract_canon_sha256":"e0bdae192547ad60007c4617ed97e5f475f719ea9f613d3bba5f68804ef5599c"},"schema_version":"1.0"},"canonical_sha256":"c3fbda2b6b8475a1be8b07e96d6aa54bc873dc2b62e6952631f1b93ba7ae8819","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.935453Z","signature_b64":"/+RM6g6aKqArdEYPxHWE4dDFSW9RmajQTGJj68+HTDdRQXaklgBl1tYNjY5So6Hrut6oN86YX1tpC9KDNmaXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3fbda2b6b8475a1be8b07e96d6aa54bc873dc2b62e6952631f1b93ba7ae8819","last_reissued_at":"2026-05-18T01:26:02.935022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.935022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00665","source_version":1,"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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWG2OnKboMEvvQjVywMuA0+4RODF01VBZ1HIWxQRhv70p/HPIzDZ5D+jrL+YN3RWKYul7ixtWUs2tos9W+nZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:38:23.307478Z"},"content_sha256":"530670e2ff68aa1bc40f138c4b8975d587c056bf2e51931ec71ba20cfec7cbb5","schema_version":"1.0","event_id":"sha256:530670e2ff68aa1bc40f138c4b8975d587c056bf2e51931ec71ba20cfec7cbb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YP55UK3LQR22DPULA7UW22VFJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Huge Unimodular N-Fold Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Pauline Sarrabezolles, Shmuel Onn","submitted_at":"2015-01-04T11:04:09Z","abstract_excerpt":"Optimization over $l\\times m\\times n$ integer $3$-way tables with given line-sums is NP-hard already for fixed $l=3$, but is polynomial time solvable with both $l,m$ fixed. In the {\\em huge} version of the problem, the variable dimension $n$ is encoded in {\\em binary}, with $t$ {\\em layer types}. It was recently shown that the huge problem can be solved in polynomial time for fixed $t$, and the complexity of the problem for variable $t$ was raised as an open problem. Here we solve this problem and show that the huge table problem can be solved in polynomial time even when the number $t$ of typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00665","kind":"arxiv","version":1},"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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9EhGUkWe+1NvJIOARsMu0tyNZ1LDkFezp5tn5FX6r8e6HBAEutYSg+2F4LAPH/XcNFcI9KgNDlRRFxFOxBRdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:38:23.308187Z"},"content_sha256":"0185b83b0c0f2906fc21793dec7a12dd93fa3fb2af0c957bb768af1263274a30","schema_version":"1.0","event_id":"sha256:0185b83b0c0f2906fc21793dec7a12dd93fa3fb2af0c957bb768af1263274a30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YP55UK3LQR22DPULA7UW22VFJP/bundle.json","state_url":"https://pith.science/pith/YP55UK3LQR22DPULA7UW22VFJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YP55UK3LQR22DPULA7UW22VFJP/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-11T12:38:23Z","links":{"resolver":"https://pith.science/pith/YP55UK3LQR22DPULA7UW22VFJP","bundle":"https://pith.science/pith/YP55UK3LQR22DPULA7UW22VFJP/bundle.json","state":"https://pith.science/pith/YP55UK3LQR22DPULA7UW22VFJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YP55UK3LQR22DPULA7UW22VFJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YP55UK3LQR22DPULA7UW22VFJP","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":"e0bdae192547ad60007c4617ed97e5f475f719ea9f613d3bba5f68804ef5599c","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T11:04:09Z","title_canon_sha256":"223aa970a933723145bf97e99cc994aac97bf31ab27bfa33f580904c25850479"},"schema_version":"1.0","source":{"id":"1501.00665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00665","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00665v1","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00665","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"YP55UK3LQR22","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YP55UK3LQR22DPUL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YP55UK3L","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:0185b83b0c0f2906fc21793dec7a12dd93fa3fb2af0c957bb768af1263274a30","target":"graph","created_at":"2026-05-18T01:26:02Z","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":"Optimization over $l\\times m\\times n$ integer $3$-way tables with given line-sums is NP-hard already for fixed $l=3$, but is polynomial time solvable with both $l,m$ fixed. In the {\\em huge} version of the problem, the variable dimension $n$ is encoded in {\\em binary}, with $t$ {\\em layer types}. It was recently shown that the huge problem can be solved in polynomial time for fixed $t$, and the complexity of the problem for variable $t$ was raised as an open problem. Here we solve this problem and show that the huge table problem can be solved in polynomial time even when the number $t$ of typ","authors_text":"Pauline Sarrabezolles, Shmuel Onn","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T11:04:09Z","title":"Huge Unimodular N-Fold Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00665","kind":"arxiv","version":1},"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:530670e2ff68aa1bc40f138c4b8975d587c056bf2e51931ec71ba20cfec7cbb5","target":"record","created_at":"2026-05-18T01:26:02Z","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":"e0bdae192547ad60007c4617ed97e5f475f719ea9f613d3bba5f68804ef5599c","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-04T11:04:09Z","title_canon_sha256":"223aa970a933723145bf97e99cc994aac97bf31ab27bfa33f580904c25850479"},"schema_version":"1.0","source":{"id":"1501.00665","kind":"arxiv","version":1}},"canonical_sha256":"c3fbda2b6b8475a1be8b07e96d6aa54bc873dc2b62e6952631f1b93ba7ae8819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3fbda2b6b8475a1be8b07e96d6aa54bc873dc2b62e6952631f1b93ba7ae8819","first_computed_at":"2026-05-18T01:26:02.935022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:02.935022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/+RM6g6aKqArdEYPxHWE4dDFSW9RmajQTGJj68+HTDdRQXaklgBl1tYNjY5So6Hrut6oN86YX1tpC9KDNmaXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:02.935453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:530670e2ff68aa1bc40f138c4b8975d587c056bf2e51931ec71ba20cfec7cbb5","sha256:0185b83b0c0f2906fc21793dec7a12dd93fa3fb2af0c957bb768af1263274a30"],"state_sha256":"ab0b7bf33a4f8e1a3738266626ee0c68935cf6ae6e6dfda5e82384d5c59b992e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8xvi8WkiRJ6U6jKcqixvf/ecIo8k6Vkc/kQrYq3QBq6D4hLxFMVeRw9M+W/rmirZCuU+WY8J2DtCmw9OwPyAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:38:23.311307Z","bundle_sha256":"6f95d8e3784c67e583cee7cd88a18410c6b00e884b0e1215cd3c422ef1e17043"}}