{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YD6RET64EACKSSAKUMN7Q6EYY3","short_pith_number":"pith:YD6RET64","canonical_record":{"source":{"id":"1404.5584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-22T18:25:14Z","cross_cats_sorted":["cs.CC","math.CO","q-bio.MN"],"title_canon_sha256":"bf2205b08a5497ff27722c319755f845a777c67fb9fad8fa437463872b102e49","abstract_canon_sha256":"5dfc0e41dadb05e93b6f5adb9d887077af9544a52ab2a83302f282f0fc83a135"},"schema_version":"1.0"},"canonical_sha256":"c0fd124fdc2004a9480aa31bf87898c6c38282b753a6de9f19c2293293b2d7b1","source":{"kind":"arxiv","id":"1404.5584","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5584","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5584v2","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5584","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"YD6RET64EACK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YD6RET64EACKSSAK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YD6RET64","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YD6RET64EACKSSAKUMN7Q6EYY3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-22T18:25:14Z","cross_cats_sorted":["cs.CC","math.CO","q-bio.MN"],"title_canon_sha256":"bf2205b08a5497ff27722c319755f845a777c67fb9fad8fa437463872b102e49","abstract_canon_sha256":"5dfc0e41dadb05e93b6f5adb9d887077af9544a52ab2a83302f282f0fc83a135"},"schema_version":"1.0"},"canonical_sha256":"c0fd124fdc2004a9480aa31bf87898c6c38282b753a6de9f19c2293293b2d7b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.641499Z","signature_b64":"xYtXe1k6156DvbCNYLZNz6tkEpeIaBQ+gOojuNvgG1V/n2rZLq7m6ppooYlYDKjZsF1fZ2r/cI8ZyxwdyRsFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0fd124fdc2004a9480aa31bf87898c6c38282b753a6de9f19c2293293b2d7b1","last_reissued_at":"2026-05-18T01:11:18.640994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.640994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5584","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-18T01:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nk2u2sWx/bdyNhaGR7rkV9RC3X3bwR+myawrjybfETJ71bI+i/74wWgGmQNZHweYzwSpGA9u00Dn51mLP4/ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:39:50.760012Z"},"content_sha256":"f1468400d9baadb6fd70b18aa12fafc7320ed6283010a8148696d17255b9281e","schema_version":"1.0","event_id":"sha256:f1468400d9baadb6fd70b18aa12fafc7320ed6283010a8148696d17255b9281e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YD6RET64EACKSSAKUMN7Q6EYY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial time vertex enumeration of convex polytopes of bounded branch-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO","q-bio.MN"],"primary_cat":"cs.CG","authors_text":"Arne C. Reimers, Leen Stougie","submitted_at":"2014-04-22T18:25:14Z","abstract_excerpt":"Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by inequalities. It is a famous and long standing open question in polyhedral theory and computational geometry whether the vertices of a polytope (bounded polyhedron), described by a set of linear constraints, can be enumerated in total polynomial time. In this paper we apply the concept of branch-decomposition to the vertex enumeration problem of polyhedra $P = \\{x : A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5584","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-18T01:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwdJW+hdUX0ohuANnD4XG/F+fyvkSYuSjkH6plIOZVIdmLRjmurxx0p8yWOWJNjeigTA17G/tSOMdwLAF5BJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:39:50.760387Z"},"content_sha256":"247e3bb16c1ab865d609477f277a96ac32a6ac3b190829475b6d25a5830f0d82","schema_version":"1.0","event_id":"sha256:247e3bb16c1ab865d609477f277a96ac32a6ac3b190829475b6d25a5830f0d82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YD6RET64EACKSSAKUMN7Q6EYY3/bundle.json","state_url":"https://pith.science/pith/YD6RET64EACKSSAKUMN7Q6EYY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YD6RET64EACKSSAKUMN7Q6EYY3/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-09T14:39:50Z","links":{"resolver":"https://pith.science/pith/YD6RET64EACKSSAKUMN7Q6EYY3","bundle":"https://pith.science/pith/YD6RET64EACKSSAKUMN7Q6EYY3/bundle.json","state":"https://pith.science/pith/YD6RET64EACKSSAKUMN7Q6EYY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YD6RET64EACKSSAKUMN7Q6EYY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YD6RET64EACKSSAKUMN7Q6EYY3","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":"5dfc0e41dadb05e93b6f5adb9d887077af9544a52ab2a83302f282f0fc83a135","cross_cats_sorted":["cs.CC","math.CO","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-22T18:25:14Z","title_canon_sha256":"bf2205b08a5497ff27722c319755f845a777c67fb9fad8fa437463872b102e49"},"schema_version":"1.0","source":{"id":"1404.5584","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5584","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5584v2","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5584","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"YD6RET64EACK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YD6RET64EACKSSAK","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YD6RET64","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:247e3bb16c1ab865d609477f277a96ac32a6ac3b190829475b6d25a5830f0d82","target":"graph","created_at":"2026-05-18T01:11:18Z","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":"Over the last years the vertex enumeration problem of polyhedra has seen a revival in the study of metabolic networks, which increased the demand for efficient vertex enumeration algorithms for high-dimensional polyhedra given by inequalities. It is a famous and long standing open question in polyhedral theory and computational geometry whether the vertices of a polytope (bounded polyhedron), described by a set of linear constraints, can be enumerated in total polynomial time. In this paper we apply the concept of branch-decomposition to the vertex enumeration problem of polyhedra $P = \\{x : A","authors_text":"Arne C. Reimers, Leen Stougie","cross_cats":["cs.CC","math.CO","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-22T18:25:14Z","title":"Polynomial time vertex enumeration of convex polytopes of bounded branch-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5584","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:f1468400d9baadb6fd70b18aa12fafc7320ed6283010a8148696d17255b9281e","target":"record","created_at":"2026-05-18T01:11:18Z","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":"5dfc0e41dadb05e93b6f5adb9d887077af9544a52ab2a83302f282f0fc83a135","cross_cats_sorted":["cs.CC","math.CO","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-22T18:25:14Z","title_canon_sha256":"bf2205b08a5497ff27722c319755f845a777c67fb9fad8fa437463872b102e49"},"schema_version":"1.0","source":{"id":"1404.5584","kind":"arxiv","version":2}},"canonical_sha256":"c0fd124fdc2004a9480aa31bf87898c6c38282b753a6de9f19c2293293b2d7b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0fd124fdc2004a9480aa31bf87898c6c38282b753a6de9f19c2293293b2d7b1","first_computed_at":"2026-05-18T01:11:18.640994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:18.640994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xYtXe1k6156DvbCNYLZNz6tkEpeIaBQ+gOojuNvgG1V/n2rZLq7m6ppooYlYDKjZsF1fZ2r/cI8ZyxwdyRsFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:18.641499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5584","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1468400d9baadb6fd70b18aa12fafc7320ed6283010a8148696d17255b9281e","sha256:247e3bb16c1ab865d609477f277a96ac32a6ac3b190829475b6d25a5830f0d82"],"state_sha256":"1316ed9326d03354690735e204af3fffd84f0c4125d01462865b50b92e3149af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wx5e1ClNEBDqZv5hMiF8sxPJrusOfPZLS5qbcTM7QyrxinjRqD6aLJoruduMVO/mP6haYXC9iW57Jvn9f/xvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:39:50.762379Z","bundle_sha256":"e7af555005232a5bf6b3dc83374932e7fe2e4f4c44b52ef3d8d38e1ab8492521"}}