{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J62T2YJO55S4SHTETSUASWLI3T","short_pith_number":"pith:J62T2YJO","schema_version":"1.0","canonical_sha256":"4fb53d612eef65c91e649ca8095968dcdf4249aab51d7bf2096143a122f22577","source":{"kind":"arxiv","id":"1910.05390","version":2},"attestation_state":"computed","paper":{"title":"The Maximum Matroid of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Vince, Meera Sitharam","submitted_at":"2019-10-11T19:57:33Z","abstract_excerpt":"The ground set for all matroids in this paper is the set of all edges of a complete graph. The notion of a {\\it maximum matroid for a graph} $G$ is introduced, and the existence and uniqueness of the maximum matroid for any graph $G$ is proved. The maximum matroid for $K_3$ is shown to be the cycle (or graphic) matroid. This result is pursued in two directions - to determine the maximum matroid for the $m$-cycle $C_m$ and to determine the maximum matroid for the complete graph $K_m$. The maximum matroid for $K_4$ is the matroid whose bases are the Laman graphs, related to structural rigidity o"},"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":"1910.05390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-11T19:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"64793b0214b3c3f28f0262070e9d071890105170d1c0f40680a1213f41c34ad3","abstract_canon_sha256":"a41ad23cb65a0344cdc2820bc0022e7931fc9d94a53faf965cf2563396041f9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:46.205294Z","signature_b64":"mUoNGDr+rmVDKeHbDObszPFm0VsFIcDCLxmAvZwVmMiPc1PrpQgHUKLYRHqxkYy1RHfgM2rzswayu5XJsEFSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fb53d612eef65c91e649ca8095968dcdf4249aab51d7bf2096143a122f22577","last_reissued_at":"2026-07-05T02:26:46.204876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:46.204876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Maximum Matroid of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Vince, Meera Sitharam","submitted_at":"2019-10-11T19:57:33Z","abstract_excerpt":"The ground set for all matroids in this paper is the set of all edges of a complete graph. The notion of a {\\it maximum matroid for a graph} $G$ is introduced, and the existence and uniqueness of the maximum matroid for any graph $G$ is proved. The maximum matroid for $K_3$ is shown to be the cycle (or graphic) matroid. This result is pursued in two directions - to determine the maximum matroid for the $m$-cycle $C_m$ and to determine the maximum matroid for the complete graph $K_m$. The maximum matroid for $K_4$ is the matroid whose bases are the Laman graphs, related to structural rigidity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05390","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.05390/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.05390","created_at":"2026-07-05T02:26:46.204934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.05390v2","created_at":"2026-07-05T02:26:46.204934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05390","created_at":"2026-07-05T02:26:46.204934+00:00"},{"alias_kind":"pith_short_12","alias_value":"J62T2YJO55S4","created_at":"2026-07-05T02:26:46.204934+00:00"},{"alias_kind":"pith_short_16","alias_value":"J62T2YJO55S4SHTE","created_at":"2026-07-05T02:26:46.204934+00:00"},{"alias_kind":"pith_short_8","alias_value":"J62T2YJO","created_at":"2026-07-05T02:26:46.204934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07757","citing_title":"Algebraic Geometry of Cactus, Pascal, and Pappus Matroids","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T","json":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T.json","graph_json":"https://pith.science/api/pith-number/J62T2YJO55S4SHTETSUASWLI3T/graph.json","events_json":"https://pith.science/api/pith-number/J62T2YJO55S4SHTETSUASWLI3T/events.json","paper":"https://pith.science/paper/J62T2YJO"},"agent_actions":{"view_html":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T","download_json":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T.json","view_paper":"https://pith.science/paper/J62T2YJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.05390&json=true","fetch_graph":"https://pith.science/api/pith-number/J62T2YJO55S4SHTETSUASWLI3T/graph.json","fetch_events":"https://pith.science/api/pith-number/J62T2YJO55S4SHTETSUASWLI3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T/action/storage_attestation","attest_author":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T/action/author_attestation","sign_citation":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T/action/citation_signature","submit_replication":"https://pith.science/pith/J62T2YJO55S4SHTETSUASWLI3T/action/replication_record"}},"created_at":"2026-07-05T02:26:46.204934+00:00","updated_at":"2026-07-05T02:26:46.204934+00:00"}