{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GEIGLWJLNGEDMH7777ZHG62YTE","short_pith_number":"pith:GEIGLWJL","canonical_record":{"source":{"id":"1309.3735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-15T07:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"e3d964f54f458c27928c7ab45d51c2ceb85bb4fcc539133e94f43a1fe4d96e9e","abstract_canon_sha256":"814dd501fa98d2f75a4d92b830f51f9d7cae80232f63387502cd99514af9667e"},"schema_version":"1.0"},"canonical_sha256":"311065d92b6988361ffffff2737b58993005bf6fd16c5122c1e9864966c36540","source":{"kind":"arxiv","id":"1309.3735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3735","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3735v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3735","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"GEIGLWJLNGED","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GEIGLWJLNGEDMH77","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GEIGLWJL","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GEIGLWJLNGEDMH7777ZHG62YTE","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-15T07:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"e3d964f54f458c27928c7ab45d51c2ceb85bb4fcc539133e94f43a1fe4d96e9e","abstract_canon_sha256":"814dd501fa98d2f75a4d92b830f51f9d7cae80232f63387502cd99514af9667e"},"schema_version":"1.0"},"canonical_sha256":"311065d92b6988361ffffff2737b58993005bf6fd16c5122c1e9864966c36540","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.671891Z","signature_b64":"BmI8cbnfqyAXQKlDnG0RP1zoKuVocFLEUdTpQRZ2SveEfnh4JNYF78XXrCV2k/MaxnLwkGezoA0VycYbfYLkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311065d92b6988361ffffff2737b58993005bf6fd16c5122c1e9864966c36540","last_reissued_at":"2026-05-18T03:13:20.671444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.671444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3735","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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gg03MSP8ZlHT1qbAij3/5flmEHsz5p9vHMIz2Z+C3d2OidsVyc5rmAuay+Gn0QSG55TIMApSlTIxUgVh0jmGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:15.380217Z"},"content_sha256":"e10382c52930434cb8fe45bee9759d26450694868d3de4a90c912cb64b9611ef","schema_version":"1.0","event_id":"sha256:e10382c52930434cb8fe45bee9759d26450694868d3de4a90c912cb64b9611ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GEIGLWJLNGEDMH7777ZHG62YTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite graphic matroids Part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Nathan Bowler, Robin Christian","submitted_at":"2013-09-15T07:45:00Z","abstract_excerpt":"An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and only if it can be represented by a graph-like topological space: that is, a graph-like space in the sense of Thomassen and Vella. This extends Tutte's characterization of finite graphic matroids.\n  The representation we construct has many pleasant topological properties. Working in the representing space, we prove that any circuit in a 3-connected graphic matroid is countable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3735","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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQRGuxgiFFePYf4n8xc0PMz6BorjlMAd9qMV4Bvh2jHaAK47614602TIrtdaEuSEDOD4mKDhHjWSJ0P3/miAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:15.380580Z"},"content_sha256":"ee6951a5c00a26845225cef3009a934b520d6fd163923fa01022fdb9e0850a74","schema_version":"1.0","event_id":"sha256:ee6951a5c00a26845225cef3009a934b520d6fd163923fa01022fdb9e0850a74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEIGLWJLNGEDMH7777ZHG62YTE/bundle.json","state_url":"https://pith.science/pith/GEIGLWJLNGEDMH7777ZHG62YTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEIGLWJLNGEDMH7777ZHG62YTE/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-22T23:23:15Z","links":{"resolver":"https://pith.science/pith/GEIGLWJLNGEDMH7777ZHG62YTE","bundle":"https://pith.science/pith/GEIGLWJLNGEDMH7777ZHG62YTE/bundle.json","state":"https://pith.science/pith/GEIGLWJLNGEDMH7777ZHG62YTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEIGLWJLNGEDMH7777ZHG62YTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GEIGLWJLNGEDMH7777ZHG62YTE","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":"814dd501fa98d2f75a4d92b830f51f9d7cae80232f63387502cd99514af9667e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-15T07:45:00Z","title_canon_sha256":"e3d964f54f458c27928c7ab45d51c2ceb85bb4fcc539133e94f43a1fe4d96e9e"},"schema_version":"1.0","source":{"id":"1309.3735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3735","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3735v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3735","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"GEIGLWJLNGED","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GEIGLWJLNGEDMH77","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GEIGLWJL","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:ee6951a5c00a26845225cef3009a934b520d6fd163923fa01022fdb9e0850a74","target":"graph","created_at":"2026-05-18T03:13:20Z","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":"An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and only if it can be represented by a graph-like topological space: that is, a graph-like space in the sense of Thomassen and Vella. This extends Tutte's characterization of finite graphic matroids.\n  The representation we construct has many pleasant topological properties. Working in the representing space, we prove that any circuit in a 3-connected graphic matroid is countable.","authors_text":"Johannes Carmesin, Nathan Bowler, Robin Christian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-15T07:45:00Z","title":"Infinite graphic matroids Part I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3735","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:e10382c52930434cb8fe45bee9759d26450694868d3de4a90c912cb64b9611ef","target":"record","created_at":"2026-05-18T03:13:20Z","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":"814dd501fa98d2f75a4d92b830f51f9d7cae80232f63387502cd99514af9667e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-15T07:45:00Z","title_canon_sha256":"e3d964f54f458c27928c7ab45d51c2ceb85bb4fcc539133e94f43a1fe4d96e9e"},"schema_version":"1.0","source":{"id":"1309.3735","kind":"arxiv","version":1}},"canonical_sha256":"311065d92b6988361ffffff2737b58993005bf6fd16c5122c1e9864966c36540","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"311065d92b6988361ffffff2737b58993005bf6fd16c5122c1e9864966c36540","first_computed_at":"2026-05-18T03:13:20.671444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:20.671444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BmI8cbnfqyAXQKlDnG0RP1zoKuVocFLEUdTpQRZ2SveEfnh4JNYF78XXrCV2k/MaxnLwkGezoA0VycYbfYLkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:20.671891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e10382c52930434cb8fe45bee9759d26450694868d3de4a90c912cb64b9611ef","sha256:ee6951a5c00a26845225cef3009a934b520d6fd163923fa01022fdb9e0850a74"],"state_sha256":"4af5e1d35ec68fad4a6bde92195174a34b1a902ce51c9aba69643ef2b90ae803"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BoTM7372Eh/WxlUqBBXA7H2BoJUvGgjF1RXUTk9z+pds7wM1xYyTZQ6pk40RKtvBw5uY4OmYfHWhjbEJl7kBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:23:15.382553Z","bundle_sha256":"75e263316416bb0754de50f24913765ccfb6d56798aafd13c070e4b99c6895c6"}}