{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IDTDWGCJWUNMPVF3GGZ2LIBJVT","short_pith_number":"pith:IDTDWGCJ","canonical_record":{"source":{"id":"1703.00945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T20:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"af949b108704233415ae1690c7522969bd259bb89553db295301317d15de71c5","abstract_canon_sha256":"b78505bf1a5e309501eb06b07fbaed883c7fb7ee1da10ca093d9edf403454a24"},"schema_version":"1.0"},"canonical_sha256":"40e63b1849b51ac7d4bb31b3a5a029acc45cb8e3a5c553ef59731a787f23b1f1","source":{"kind":"arxiv","id":"1703.00945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00945","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00945v1","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00945","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"IDTDWGCJWUNM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDTDWGCJWUNMPVF3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDTDWGCJ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IDTDWGCJWUNMPVF3GGZ2LIBJVT","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T20:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"af949b108704233415ae1690c7522969bd259bb89553db295301317d15de71c5","abstract_canon_sha256":"b78505bf1a5e309501eb06b07fbaed883c7fb7ee1da10ca093d9edf403454a24"},"schema_version":"1.0"},"canonical_sha256":"40e63b1849b51ac7d4bb31b3a5a029acc45cb8e3a5c553ef59731a787f23b1f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:37.482441Z","signature_b64":"2ZBfqL1JduchiYypg+kkhW862voAooeZH/ZvxYbWb4ffalQgIyX6VitZTqasXIMDh5AtaGJQKGfUmKBv2TByBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40e63b1849b51ac7d4bb31b3a5a029acc45cb8e3a5c553ef59731a787f23b1f1","last_reissued_at":"2026-05-18T00:49:37.481749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:37.481749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00945","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-18T00:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVoMYDE0KfRoYFUi+bWyIlcCNPyjoVVukIT4XghUQhNKb0NE4MSRY/fO+qIYn86SrM7qpEnjvXO5LbatpRRvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:31:48.240809Z"},"content_sha256":"1de9a28edecaf368a1c973cb0a083389fd7a16d35d5002129d6750a78f04a8af","schema_version":"1.0","event_id":"sha256:1de9a28edecaf368a1c973cb0a083389fd7a16d35d5002129d6750a78f04a8af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IDTDWGCJWUNMPVF3GGZ2LIBJVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A splitter theorem for connected clutters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Cameron, Dillon Mayhew","submitted_at":"2017-03-02T20:50:09Z","abstract_excerpt":"A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for clutters that generalises that of connectivity for matroids. We prove a splitter theorem for connected clutters that has the splitter theorem for connected matroids as a special case: if $M$ and $N$ are connected clutters, and $N$ is a proper minor of $M$, then there is an element in $E(M)$ that can be deleted or contracted to produce a connected clutter wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00945","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-18T00:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Qh7tDYdVYCsfPYoFqDWdneA3nJuNK8bpMxvokvw8oKsg+BbfnTmLt6P3RHq/bh2bu6HR2/y6PeFG5h7qbYWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T01:31:48.241155Z"},"content_sha256":"131b042788a3d0008f85b346f1d697fb03618f1e3845f41c9c99febc9a62cf14","schema_version":"1.0","event_id":"sha256:131b042788a3d0008f85b346f1d697fb03618f1e3845f41c9c99febc9a62cf14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT/bundle.json","state_url":"https://pith.science/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT/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-25T01:31:48Z","links":{"resolver":"https://pith.science/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT","bundle":"https://pith.science/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT/bundle.json","state":"https://pith.science/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDTDWGCJWUNMPVF3GGZ2LIBJVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IDTDWGCJWUNMPVF3GGZ2LIBJVT","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":"b78505bf1a5e309501eb06b07fbaed883c7fb7ee1da10ca093d9edf403454a24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T20:50:09Z","title_canon_sha256":"af949b108704233415ae1690c7522969bd259bb89553db295301317d15de71c5"},"schema_version":"1.0","source":{"id":"1703.00945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00945","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00945v1","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00945","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"IDTDWGCJWUNM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IDTDWGCJWUNMPVF3","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IDTDWGCJ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:131b042788a3d0008f85b346f1d697fb03618f1e3845f41c9c99febc9a62cf14","target":"graph","created_at":"2026-05-18T00:49:37Z","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":"A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for clutters that generalises that of connectivity for matroids. We prove a splitter theorem for connected clutters that has the splitter theorem for connected matroids as a special case: if $M$ and $N$ are connected clutters, and $N$ is a proper minor of $M$, then there is an element in $E(M)$ that can be deleted or contracted to produce a connected clutter wit","authors_text":"Amanda Cameron, Dillon Mayhew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T20:50:09Z","title":"A splitter theorem for connected clutters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00945","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:1de9a28edecaf368a1c973cb0a083389fd7a16d35d5002129d6750a78f04a8af","target":"record","created_at":"2026-05-18T00:49:37Z","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":"b78505bf1a5e309501eb06b07fbaed883c7fb7ee1da10ca093d9edf403454a24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T20:50:09Z","title_canon_sha256":"af949b108704233415ae1690c7522969bd259bb89553db295301317d15de71c5"},"schema_version":"1.0","source":{"id":"1703.00945","kind":"arxiv","version":1}},"canonical_sha256":"40e63b1849b51ac7d4bb31b3a5a029acc45cb8e3a5c553ef59731a787f23b1f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40e63b1849b51ac7d4bb31b3a5a029acc45cb8e3a5c553ef59731a787f23b1f1","first_computed_at":"2026-05-18T00:49:37.481749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:37.481749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ZBfqL1JduchiYypg+kkhW862voAooeZH/ZvxYbWb4ffalQgIyX6VitZTqasXIMDh5AtaGJQKGfUmKBv2TByBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:37.482441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de9a28edecaf368a1c973cb0a083389fd7a16d35d5002129d6750a78f04a8af","sha256:131b042788a3d0008f85b346f1d697fb03618f1e3845f41c9c99febc9a62cf14"],"state_sha256":"e64afc6579b0d1323b631f61b8bbbaa59a84e59db99a765f0b8d564d7a54acaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFEu0aM/8wabUqB6yCHfiFiXdkVnqHEKqh2qJossEuJzZ40vhR4KEUhasDnGpXNKm8FXfoTkLMTOnK0kjUufAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T01:31:48.243096Z","bundle_sha256":"7f5c0006fd1af0d8d6cd906bb84866777e1111e544a160b409ebd8091019c37d"}}