{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LAXRVYMQ5Z4I4GPIAEVM2VR52U","short_pith_number":"pith:LAXRVYMQ","canonical_record":{"source":{"id":"1511.03403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T07:10:10Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"title_canon_sha256":"138dfce224e974b8a68683dc9fcd4ef3f9a9ea4a52cf296931b10f305e688a76","abstract_canon_sha256":"64ef5806a189b55ca06bd500d23ac14625f299fa32d2ab6dc309b293dcd3b4a6"},"schema_version":"1.0"},"canonical_sha256":"582f1ae190ee788e19e8012acd563dd50d3f206c7a12a2ee395bcd3ecd3931f8","source":{"kind":"arxiv","id":"1511.03403","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03403","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03403v3","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03403","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"LAXRVYMQ5Z4I","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAXRVYMQ5Z4I4GPI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAXRVYMQ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LAXRVYMQ5Z4I4GPIAEVM2VR52U","target":"record","payload":{"canonical_record":{"source":{"id":"1511.03403","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T07:10:10Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"title_canon_sha256":"138dfce224e974b8a68683dc9fcd4ef3f9a9ea4a52cf296931b10f305e688a76","abstract_canon_sha256":"64ef5806a189b55ca06bd500d23ac14625f299fa32d2ab6dc309b293dcd3b4a6"},"schema_version":"1.0"},"canonical_sha256":"582f1ae190ee788e19e8012acd563dd50d3f206c7a12a2ee395bcd3ecd3931f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:51.891069Z","signature_b64":"WmpHfeu0gd33F1GQWsQfrMH2y5RyN89EgioogoPd9aosrY8TqG2kSrOGFkCV7xDKerM7zdu2Pkrd4oulLpo9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"582f1ae190ee788e19e8012acd563dd50d3f206c7a12a2ee395bcd3ecd3931f8","last_reissued_at":"2026-05-18T00:42:51.890380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:51.890380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.03403","source_version":3,"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-18T00:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54vIt3nMeHYGYlxoVnAN9JsHYZ/cCQbDHKGj4HvqnHNAa4NCe3D8CtUG5Ubnv3NtTez4lhUKPTV/sBL8BETWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:19:18.959230Z"},"content_sha256":"efa2f7f0286f2773b53887b30a594cddce26e1eb51524240e65bb2d5443c34d1","schema_version":"1.0","event_id":"sha256:efa2f7f0286f2773b53887b30a594cddce26e1eb51524240e65bb2d5443c34d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LAXRVYMQ5Z4I4GPIAEVM2VR52U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Huge tables and multicommodity flows are fixed parameter tractable via unimodular integer Caratheodory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"primary_cat":"math.OC","authors_text":"Shmuel Onn","submitted_at":"2015-11-11T07:10:10Z","abstract_excerpt":"The three-way table problem is to decide if there exists an l x m x n table satisfying given line sums, and find a table if there is one. It is NP-complete already for l=3 and every bounded integer program can be isomorphically represented in polynomial time for some m and n as some 3 x m x n table problem. Recently, the problem was shown to be fixed-parameter tractable with parameters l,m. Here we extend this and show that the huge version of the problem, where the variable side n is a huge number encoded in binary, is also fixed-parameter tractable with parameters l,m. We also conclude that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03403","kind":"arxiv","version":3},"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-18T00:42:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3xVUrgTHeQt9EM6R+YjPXD7R1/MtXdrMyUXMQXxb+q84bv3ipD2n9QGsfs7eOp0Rzb1vePmUJTPariqjWuvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:19:18.959969Z"},"content_sha256":"5c1de3bdca67a36d3093c2f2341863ed9b9b1e2b66b9171ad88fec3dcc3c1257","schema_version":"1.0","event_id":"sha256:5c1de3bdca67a36d3093c2f2341863ed9b9b1e2b66b9171ad88fec3dcc3c1257"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U/bundle.json","state_url":"https://pith.science/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U/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-11T15:19:18Z","links":{"resolver":"https://pith.science/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U","bundle":"https://pith.science/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U/bundle.json","state":"https://pith.science/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAXRVYMQ5Z4I4GPIAEVM2VR52U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LAXRVYMQ5Z4I4GPIAEVM2VR52U","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":"64ef5806a189b55ca06bd500d23ac14625f299fa32d2ab6dc309b293dcd3b4a6","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T07:10:10Z","title_canon_sha256":"138dfce224e974b8a68683dc9fcd4ef3f9a9ea4a52cf296931b10f305e688a76"},"schema_version":"1.0","source":{"id":"1511.03403","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03403","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03403v3","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03403","created_at":"2026-05-18T00:42:51Z"},{"alias_kind":"pith_short_12","alias_value":"LAXRVYMQ5Z4I","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAXRVYMQ5Z4I4GPI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAXRVYMQ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:5c1de3bdca67a36d3093c2f2341863ed9b9b1e2b66b9171ad88fec3dcc3c1257","target":"graph","created_at":"2026-05-18T00:42:51Z","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":"The three-way table problem is to decide if there exists an l x m x n table satisfying given line sums, and find a table if there is one. It is NP-complete already for l=3 and every bounded integer program can be isomorphically represented in polynomial time for some m and n as some 3 x m x n table problem. Recently, the problem was shown to be fixed-parameter tractable with parameters l,m. Here we extend this and show that the huge version of the problem, where the variable side n is a huge number encoded in binary, is also fixed-parameter tractable with parameters l,m. We also conclude that ","authors_text":"Shmuel Onn","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T07:10:10Z","title":"Huge tables and multicommodity flows are fixed parameter tractable via unimodular integer Caratheodory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03403","kind":"arxiv","version":3},"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:efa2f7f0286f2773b53887b30a594cddce26e1eb51524240e65bb2d5443c34d1","target":"record","created_at":"2026-05-18T00:42:51Z","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":"64ef5806a189b55ca06bd500d23ac14625f299fa32d2ab6dc309b293dcd3b4a6","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-11T07:10:10Z","title_canon_sha256":"138dfce224e974b8a68683dc9fcd4ef3f9a9ea4a52cf296931b10f305e688a76"},"schema_version":"1.0","source":{"id":"1511.03403","kind":"arxiv","version":3}},"canonical_sha256":"582f1ae190ee788e19e8012acd563dd50d3f206c7a12a2ee395bcd3ecd3931f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"582f1ae190ee788e19e8012acd563dd50d3f206c7a12a2ee395bcd3ecd3931f8","first_computed_at":"2026-05-18T00:42:51.890380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:51.890380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WmpHfeu0gd33F1GQWsQfrMH2y5RyN89EgioogoPd9aosrY8TqG2kSrOGFkCV7xDKerM7zdu2Pkrd4oulLpo9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:51.891069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03403","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efa2f7f0286f2773b53887b30a594cddce26e1eb51524240e65bb2d5443c34d1","sha256:5c1de3bdca67a36d3093c2f2341863ed9b9b1e2b66b9171ad88fec3dcc3c1257"],"state_sha256":"119579887a2a56781c4d37980bff1226a975261865f4238db382ec461f6ed954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vca3iZaYcxQJ9SuusNBoJx59uDdJaQS5HrajJRqxB7MbyCA0tJUmcnKpYgDJoATPorIBr4tFE4O0lSp86npLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:19:18.964015Z","bundle_sha256":"fd7c65dce8e8a86637ae2f979ebdbf8f0c403c6a6446faccd45fcd1b41dcc109"}}