{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6DTZG47WTYWCHDHBQ7C5GEOQVA","short_pith_number":"pith:6DTZG47W","schema_version":"1.0","canonical_sha256":"f0e79373f69e2c238ce187c5d311d0a83b61bfae998f64592c86fbe6a1e94141","source":{"kind":"arxiv","id":"1503.04406","version":5},"attestation_state":"computed","paper":{"title":"Isotropic matroids I: Multimatroids and neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi, Robert Brijder","submitted_at":"2015-03-15T10:00:12Z","abstract_excerpt":"Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G incorporates information about graphs locally equivalent to G. Specific results of the latter type include a characterization of graphs that are locally equivalent to bipartite graphs, a direct proof that two forests are isomorphic if and only if their isotropic matroids are isomorphic, and a way to express local equivalence indirectly, using only edge pivots."},"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":"1503.04406","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-15T10:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"c91ea0b07036b717e4b974689e6f9c1be179db8dbfe67d36a11762f4458f241a","abstract_canon_sha256":"93590990f5a1ae7d7537e12f6835fef7a0d77398c426db9adf70c179423bbdd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:52.397560Z","signature_b64":"tQgWI+8H5uoasVqcw4lDars7AlHq557bVP5D819wYWziRmzvlg0OTX0z6abzpR/0uyZvxTw7Yy/UTQKUOj/yCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0e79373f69e2c238ce187c5d311d0a83b61bfae998f64592c86fbe6a1e94141","last_reissued_at":"2026-05-18T01:01:52.396750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:52.396750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isotropic matroids I: Multimatroids and neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lorenzo Traldi, Robert Brijder","submitted_at":"2015-03-15T10:00:12Z","abstract_excerpt":"Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G incorporates information about graphs locally equivalent to G. Specific results of the latter type include a characterization of graphs that are locally equivalent to bipartite graphs, a direct proof that two forests are isomorphic if and only if their isotropic matroids are isomorphic, and a way to express local equivalence indirectly, using only edge pivots."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04406","kind":"arxiv","version":5},"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":"1503.04406","created_at":"2026-05-18T01:01:52.396875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04406v5","created_at":"2026-05-18T01:01:52.396875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04406","created_at":"2026-05-18T01:01:52.396875+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DTZG47WTYWC","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DTZG47WTYWCHDHB","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DTZG47W","created_at":"2026-05-18T12:29:07.941421+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/6DTZG47WTYWCHDHBQ7C5GEOQVA","json":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA.json","graph_json":"https://pith.science/api/pith-number/6DTZG47WTYWCHDHBQ7C5GEOQVA/graph.json","events_json":"https://pith.science/api/pith-number/6DTZG47WTYWCHDHBQ7C5GEOQVA/events.json","paper":"https://pith.science/paper/6DTZG47W"},"agent_actions":{"view_html":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA","download_json":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA.json","view_paper":"https://pith.science/paper/6DTZG47W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04406&json=true","fetch_graph":"https://pith.science/api/pith-number/6DTZG47WTYWCHDHBQ7C5GEOQVA/graph.json","fetch_events":"https://pith.science/api/pith-number/6DTZG47WTYWCHDHBQ7C5GEOQVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA/action/storage_attestation","attest_author":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA/action/author_attestation","sign_citation":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA/action/citation_signature","submit_replication":"https://pith.science/pith/6DTZG47WTYWCHDHBQ7C5GEOQVA/action/replication_record"}},"created_at":"2026-05-18T01:01:52.396875+00:00","updated_at":"2026-05-18T01:01:52.396875+00:00"}