{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WRPHV55P2OGZ3VMXTKZKD5FX6J","short_pith_number":"pith:WRPHV55P","schema_version":"1.0","canonical_sha256":"b45e7af7afd38d9dd5979ab2a1f4b7f2766c6b4233b5c702d92b56754d237111","source":{"kind":"arxiv","id":"1107.5493","version":6},"attestation_state":"computed","paper":{"title":"The adjacency matroid of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hendrik Jan Hoogeboom, Lorenzo Traldi, Robert Brijder","submitted_at":"2011-07-27T14:46:15Z","abstract_excerpt":"If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the structure of $G$. Jaeger proved that every binary matroid is $M_{A}(G)$ for some $G$ [Ann. Discrete Math. 17 (1983), 371-376].\n  The relationship between the matroidal structure of $M_{A}(G)$ and the graphical structure of $G$ has many interesting features. For instance, the matroid minors $M_{A}(G)-v$ and $M_{A}(G)/v$ are both of the form $M_{A}(G^{\\prime}-v)$ "},"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":"1107.5493","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-27T14:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"6056eb0c2cdc988bce4b17d7c59d58f1ecd5a3792902b59ddfa7ab7428a15630","abstract_canon_sha256":"656429e1fbe699c016300788ba5f4f9a081e2b61e7e32b8b7189b5427fd28857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:27.053590Z","signature_b64":"r3veN+XZLChR+Q8f7Mkev1snPa3qnRI/Lq4K2ZcbiE1fvgty0dZYkQvxI6SpUGQTHtuMtGhz6xGc6PIE5CrpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b45e7af7afd38d9dd5979ab2a1f4b7f2766c6b4233b5c702d92b56754d237111","last_reissued_at":"2026-05-18T03:14:27.053073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:27.053073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The adjacency matroid of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hendrik Jan Hoogeboom, Lorenzo Traldi, Robert Brijder","submitted_at":"2011-07-27T14:46:15Z","abstract_excerpt":"If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the structure of $G$. Jaeger proved that every binary matroid is $M_{A}(G)$ for some $G$ [Ann. Discrete Math. 17 (1983), 371-376].\n  The relationship between the matroidal structure of $M_{A}(G)$ and the graphical structure of $G$ has many interesting features. For instance, the matroid minors $M_{A}(G)-v$ and $M_{A}(G)/v$ are both of the form $M_{A}(G^{\\prime}-v)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5493","kind":"arxiv","version":6},"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":"1107.5493","created_at":"2026-05-18T03:14:27.053148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5493v6","created_at":"2026-05-18T03:14:27.053148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5493","created_at":"2026-05-18T03:14:27.053148+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRPHV55P2OGZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRPHV55P2OGZ3VMX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRPHV55P","created_at":"2026-05-18T12:26:44.992195+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/WRPHV55P2OGZ3VMXTKZKD5FX6J","json":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J.json","graph_json":"https://pith.science/api/pith-number/WRPHV55P2OGZ3VMXTKZKD5FX6J/graph.json","events_json":"https://pith.science/api/pith-number/WRPHV55P2OGZ3VMXTKZKD5FX6J/events.json","paper":"https://pith.science/paper/WRPHV55P"},"agent_actions":{"view_html":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J","download_json":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J.json","view_paper":"https://pith.science/paper/WRPHV55P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5493&json=true","fetch_graph":"https://pith.science/api/pith-number/WRPHV55P2OGZ3VMXTKZKD5FX6J/graph.json","fetch_events":"https://pith.science/api/pith-number/WRPHV55P2OGZ3VMXTKZKD5FX6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J/action/storage_attestation","attest_author":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J/action/author_attestation","sign_citation":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J/action/citation_signature","submit_replication":"https://pith.science/pith/WRPHV55P2OGZ3VMXTKZKD5FX6J/action/replication_record"}},"created_at":"2026-05-18T03:14:27.053148+00:00","updated_at":"2026-05-18T03:14:27.053148+00:00"}