{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XQKBFNXL54TVOVL7BH53ATGUPB","short_pith_number":"pith:XQKBFNXL","schema_version":"1.0","canonical_sha256":"bc1412b6ebef2757557f09fbb04cd4785ec538088c25f2221d413c576ac051da","source":{"kind":"arxiv","id":"1606.07370","version":2},"attestation_state":"computed","paper":{"title":"Almost balanced biased graph representations of frame matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daryl Funk, Matt DeVos","submitted_at":"2016-06-23T16:44:33Z","abstract_excerpt":"Given a 3-connected biased graph $\\Omega$ with a balancing vertex, and with frame matroid $F(\\Omega)$ nongraphic and 3-connected, we determine all biased graphs $\\Omega'$ with $F(\\Omega') = F(\\Omega)$. As a consequence, we show that if $M$ is a 4-connected nongraphic frame matroid represented by a biased graph $\\Omega$ having a balancing vertex, then $\\Omega$ essentially uniquely represents $M$. More precisely, all biased graphs representing $M$ are obtained from $\\Omega$ by replacing a subset of the edges incident to its unique balancing vertex with unbalanced loops."},"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":"1606.07370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-23T16:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"61dda58525a6fcdf012991b93594ec9480b21a689af7fc961b96408bbe2b3782","abstract_canon_sha256":"99dbfc420605858c3533e01d7e34ce6b33b73e44cf8107ba8f77586babb34ab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:28.779517Z","signature_b64":"+IxcaE4d7hFgP6nN5KJ3FbAOwpazqV0oIWZSw8y9/hYvwOh70+MLZgPkkEKtPcIt6lcXrwyXUf14kCqqBtMwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc1412b6ebef2757557f09fbb04cd4785ec538088c25f2221d413c576ac051da","last_reissued_at":"2026-05-18T00:30:28.778900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:28.778900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost balanced biased graph representations of frame matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daryl Funk, Matt DeVos","submitted_at":"2016-06-23T16:44:33Z","abstract_excerpt":"Given a 3-connected biased graph $\\Omega$ with a balancing vertex, and with frame matroid $F(\\Omega)$ nongraphic and 3-connected, we determine all biased graphs $\\Omega'$ with $F(\\Omega') = F(\\Omega)$. As a consequence, we show that if $M$ is a 4-connected nongraphic frame matroid represented by a biased graph $\\Omega$ having a balancing vertex, then $\\Omega$ essentially uniquely represents $M$. More precisely, all biased graphs representing $M$ are obtained from $\\Omega$ by replacing a subset of the edges incident to its unique balancing vertex with unbalanced loops."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07370","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":""},"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":"1606.07370","created_at":"2026-05-18T00:30:28.778988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07370v2","created_at":"2026-05-18T00:30:28.778988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07370","created_at":"2026-05-18T00:30:28.778988+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQKBFNXL54TV","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQKBFNXL54TVOVL7","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQKBFNXL","created_at":"2026-05-18T12:30:51.357362+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/XQKBFNXL54TVOVL7BH53ATGUPB","json":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB.json","graph_json":"https://pith.science/api/pith-number/XQKBFNXL54TVOVL7BH53ATGUPB/graph.json","events_json":"https://pith.science/api/pith-number/XQKBFNXL54TVOVL7BH53ATGUPB/events.json","paper":"https://pith.science/paper/XQKBFNXL"},"agent_actions":{"view_html":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB","download_json":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB.json","view_paper":"https://pith.science/paper/XQKBFNXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07370&json=true","fetch_graph":"https://pith.science/api/pith-number/XQKBFNXL54TVOVL7BH53ATGUPB/graph.json","fetch_events":"https://pith.science/api/pith-number/XQKBFNXL54TVOVL7BH53ATGUPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB/action/storage_attestation","attest_author":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB/action/author_attestation","sign_citation":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB/action/citation_signature","submit_replication":"https://pith.science/pith/XQKBFNXL54TVOVL7BH53ATGUPB/action/replication_record"}},"created_at":"2026-05-18T00:30:28.778988+00:00","updated_at":"2026-05-18T00:30:28.778988+00:00"}