{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3SIQNJNHSXM3TRJSTXDL4NGCQD","short_pith_number":"pith:3SIQNJNH","canonical_record":{"source":{"id":"1405.0812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-05T07:58:56Z","cross_cats_sorted":["math.AC","math.ST","stat.TH"],"title_canon_sha256":"4b40178bd9775653f2dba1269da6c1f3d492bc652ef3b9dba957920b6d467529","abstract_canon_sha256":"0bb0e3bb9b1fa0f4610cde9fa5d626e3397526e953a189374c1f8041c2f50211"},"schema_version":"1.0"},"canonical_sha256":"dc9106a5a795d9b9c5329dc6be34c280e8b265d33692c5143163b9a29e7ebd4d","source":{"kind":"arxiv","id":"1405.0812","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0812","created_at":"2026-05-18T02:29:11Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0812v2","created_at":"2026-05-18T02:29:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0812","created_at":"2026-05-18T02:29:11Z"},{"alias_kind":"pith_short_12","alias_value":"3SIQNJNHSXM3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3SIQNJNHSXM3TRJS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3SIQNJNH","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3SIQNJNHSXM3TRJSTXDL4NGCQD","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-05T07:58:56Z","cross_cats_sorted":["math.AC","math.ST","stat.TH"],"title_canon_sha256":"4b40178bd9775653f2dba1269da6c1f3d492bc652ef3b9dba957920b6d467529","abstract_canon_sha256":"0bb0e3bb9b1fa0f4610cde9fa5d626e3397526e953a189374c1f8041c2f50211"},"schema_version":"1.0"},"canonical_sha256":"dc9106a5a795d9b9c5329dc6be34c280e8b265d33692c5143163b9a29e7ebd4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:11.015185Z","signature_b64":"mZdm5gu7wAxa3KMPDj2rHakAQGhHPjAtX0SDOYqcec4eDOwJbVZiQZ5ObpY2m20gVjEdQ90gWQRFyep6KEwaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc9106a5a795d9b9c5329dc6be34c280e8b265d33692c5143163b9a29e7ebd4d","last_reissued_at":"2026-05-18T02:29:11.014696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:11.014696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0812","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-18T02:29:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDSLkMJn0G4D4EmOpqSZOZPNZTELd5GVPy/rvt1AhYn7t5i6xI0YxFGqlEGkwlMKTWARmSaGO931Wkb22EmEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:27:58.945794Z"},"content_sha256":"568ecf0e4609641c213ed0772f2f3aa20c2caa722ce765f1e6ae79ba7b47e7ee","schema_version":"1.0","event_id":"sha256:568ecf0e4609641c213ed0772f2f3aa20c2caa722ce765f1e6ae79ba7b47e7ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3SIQNJNHSXM3TRJSTXDL4NGCQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Connectivity of Fiber Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Raymond Hemmecke, Tobias Windisch","submitted_at":"2014-05-05T07:58:56Z","abstract_excerpt":"We consider the connectivity of fiber graphs with respect to Gr\\\"obner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gr\\\"obner basis and prove that their edge-connectivity is lowest possible and can have an arbitrarily large distance from the minimal degree. We then show that graph-theoretic properties of fiber graphs do not depend on the size of the right-hand side. This provides a counterexample to a conjecture of Engstr\\\"om on the node-connectivity of fiber graphs. Our main result shows that the edge-connectivity in all fiber graphs of this co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0812","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-18T02:29:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWCX5nE48qUvpleuWvhXTrr+gzCo7g07/qpgbyDJtkyanKPOFlXfuKlUk1OvGVXtQGGpHn6qEawFD0WEcsepCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:27:58.946489Z"},"content_sha256":"ff718117fc9d0c08152ca8f4b7f52889c8c1caf5513459a4b081908ff44eaa25","schema_version":"1.0","event_id":"sha256:ff718117fc9d0c08152ca8f4b7f52889c8c1caf5513459a4b081908ff44eaa25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD/bundle.json","state_url":"https://pith.science/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD/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-05-27T18:27:58Z","links":{"resolver":"https://pith.science/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD","bundle":"https://pith.science/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD/bundle.json","state":"https://pith.science/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SIQNJNHSXM3TRJSTXDL4NGCQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3SIQNJNHSXM3TRJSTXDL4NGCQD","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":"0bb0e3bb9b1fa0f4610cde9fa5d626e3397526e953a189374c1f8041c2f50211","cross_cats_sorted":["math.AC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-05T07:58:56Z","title_canon_sha256":"4b40178bd9775653f2dba1269da6c1f3d492bc652ef3b9dba957920b6d467529"},"schema_version":"1.0","source":{"id":"1405.0812","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0812","created_at":"2026-05-18T02:29:11Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0812v2","created_at":"2026-05-18T02:29:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0812","created_at":"2026-05-18T02:29:11Z"},{"alias_kind":"pith_short_12","alias_value":"3SIQNJNHSXM3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3SIQNJNHSXM3TRJS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3SIQNJNH","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:ff718117fc9d0c08152ca8f4b7f52889c8c1caf5513459a4b081908ff44eaa25","target":"graph","created_at":"2026-05-18T02:29:11Z","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":"We consider the connectivity of fiber graphs with respect to Gr\\\"obner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gr\\\"obner basis and prove that their edge-connectivity is lowest possible and can have an arbitrarily large distance from the minimal degree. We then show that graph-theoretic properties of fiber graphs do not depend on the size of the right-hand side. This provides a counterexample to a conjecture of Engstr\\\"om on the node-connectivity of fiber graphs. Our main result shows that the edge-connectivity in all fiber graphs of this co","authors_text":"Raymond Hemmecke, Tobias Windisch","cross_cats":["math.AC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-05T07:58:56Z","title":"On the Connectivity of Fiber Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0812","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:568ecf0e4609641c213ed0772f2f3aa20c2caa722ce765f1e6ae79ba7b47e7ee","target":"record","created_at":"2026-05-18T02:29:11Z","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":"0bb0e3bb9b1fa0f4610cde9fa5d626e3397526e953a189374c1f8041c2f50211","cross_cats_sorted":["math.AC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-05T07:58:56Z","title_canon_sha256":"4b40178bd9775653f2dba1269da6c1f3d492bc652ef3b9dba957920b6d467529"},"schema_version":"1.0","source":{"id":"1405.0812","kind":"arxiv","version":2}},"canonical_sha256":"dc9106a5a795d9b9c5329dc6be34c280e8b265d33692c5143163b9a29e7ebd4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc9106a5a795d9b9c5329dc6be34c280e8b265d33692c5143163b9a29e7ebd4d","first_computed_at":"2026-05-18T02:29:11.014696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:11.014696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mZdm5gu7wAxa3KMPDj2rHakAQGhHPjAtX0SDOYqcec4eDOwJbVZiQZ5ObpY2m20gVjEdQ90gWQRFyep6KEwaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:11.015185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0812","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:568ecf0e4609641c213ed0772f2f3aa20c2caa722ce765f1e6ae79ba7b47e7ee","sha256:ff718117fc9d0c08152ca8f4b7f52889c8c1caf5513459a4b081908ff44eaa25"],"state_sha256":"7c17244cfc0c02b9c112dd3834bf71cb92b1aea98684b6cc61c0f826aef945ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VAZm0vYYPHFsF8Mgv0ZgPtmDAiQVvOm/d3tTBiiw+FgJokWOBwyon5s9nf6e7PkTI/h1YkhIodX4tXFtuF6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:27:58.950443Z","bundle_sha256":"8307d1207ebc562e5a19bd8c5dfafd92743b2e88b6385a04ed5309bc3e66abd9"}}