{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V5I22X55LPVYRYVG2FWAN5I7MK","short_pith_number":"pith:V5I22X55","schema_version":"1.0","canonical_sha256":"af51ad5fbd5beb88e2a6d16c06f51f62b029d9d109a50b9cbde1a48e52caed28","source":{"kind":"arxiv","id":"1304.6973","version":1},"attestation_state":"computed","paper":{"title":"The ubiquity of Psi-matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Nathan Bowler","submitted_at":"2013-04-25T18:04:47Z","abstract_excerpt":"Solving (for tame matroids) a problem of Aigner-Horev, Diestel and Postle, we prove that every tame matroid M can be reconstructed from its canonical tree decomposition into 3-connected pieces, circuits and cocircuits together with information about which ends of the decomposition tree are used by M .\n  For every locally finite graph G, we show that every tame matroid whose circuits are topological circles of G and whose cocircuits are bonds of G is determined by the set Psi of ends it uses, that is, it is a Psi-matroid."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1304.6973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T18:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"57a47e7f7c63647040043f94562f5e84614d3d49e235891e38ea45dbdeccc574","abstract_canon_sha256":"8aa808ec04d0e45b8386613725d035428a797275209c4d43164eb03e993cb16f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.677673Z","signature_b64":"HfY/O5OH+ZFWm1MA9Tzqfn/GDz+1MnUD0Mr/Nm7DVqYXdlM2UNbNgddg5Y9SkfWia/PGlIPWCQh4sxyYhWXzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af51ad5fbd5beb88e2a6d16c06f51f62b029d9d109a50b9cbde1a48e52caed28","last_reissued_at":"2026-05-18T03:27:10.676913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.676913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The ubiquity of Psi-matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin, Nathan Bowler","submitted_at":"2013-04-25T18:04:47Z","abstract_excerpt":"Solving (for tame matroids) a problem of Aigner-Horev, Diestel and Postle, we prove that every tame matroid M can be reconstructed from its canonical tree decomposition into 3-connected pieces, circuits and cocircuits together with information about which ends of the decomposition tree are used by M .\n  For every locally finite graph G, we show that every tame matroid whose circuits are topological circles of G and whose cocircuits are bonds of G is determined by the set Psi of ends it uses, that is, it is a Psi-matroid."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6973","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.6973","created_at":"2026-05-18T03:27:10.677028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6973v1","created_at":"2026-05-18T03:27:10.677028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6973","created_at":"2026-05-18T03:27:10.677028+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5I22X55LPVY","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5I22X55LPVYRYVG","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5I22X55","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK","json":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK.json","graph_json":"https://pith.science/api/pith-number/V5I22X55LPVYRYVG2FWAN5I7MK/graph.json","events_json":"https://pith.science/api/pith-number/V5I22X55LPVYRYVG2FWAN5I7MK/events.json","paper":"https://pith.science/paper/V5I22X55"},"agent_actions":{"view_html":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK","download_json":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK.json","view_paper":"https://pith.science/paper/V5I22X55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6973&json=true","fetch_graph":"https://pith.science/api/pith-number/V5I22X55LPVYRYVG2FWAN5I7MK/graph.json","fetch_events":"https://pith.science/api/pith-number/V5I22X55LPVYRYVG2FWAN5I7MK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK/action/storage_attestation","attest_author":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK/action/author_attestation","sign_citation":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK/action/citation_signature","submit_replication":"https://pith.science/pith/V5I22X55LPVYRYVG2FWAN5I7MK/action/replication_record"}},"created_at":"2026-05-18T03:27:10.677028+00:00","updated_at":"2026-05-18T03:27:10.677028+00:00"}