{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:4XES2443KO4SVOUAGK65NLYL5X","short_pith_number":"pith:4XES2443","schema_version":"1.0","canonical_sha256":"e5c92d739b53b92aba8032bdd6af0bedc528f8dac517d0d2ba110fab1871a834","source":{"kind":"arxiv","id":"0901.0885","version":1},"attestation_state":"computed","paper":{"title":"On the representability of totally unimodular matrices on bidirected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"B. Kotnyek, G. Appa, K. Papalamprou, L. Pitsoulis","submitted_at":"2009-01-07T18:03:13Z","abstract_excerpt":"Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called $k$-sums starting from network matrices and their transposes and two compact representation matrices $B_{1}, B_{2}$ of a certain ten element matroid. Given that $B_{1}, B_{2}$ are binet matrices we examine the $k$-sums of network and binet matrices. It is shown that the $k$-sum of a network and a binet matrix is a binet matrix, but binet matrices are not closed under this operation for $k=2,3$. A new class of matrices is"},"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":"0901.0885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T18:03:13Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"11948caea71f4aa0f2896e2cbb3db1eb98b84b9d2c032b88f63547c98dd09c71","abstract_canon_sha256":"c1764fd75ab4231dae24483e3d3bbb2fc71c826f7ac430d79a39efba16a55468"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:21.700265Z","signature_b64":"KfCe2dHNH3Budh1MEiJdrzSefWRisar3ZA7FWDNVIO/ny41MyD+bHnFQVWRztv3pT/ZebIVRZRlakRydToKGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5c92d739b53b92aba8032bdd6af0bedc528f8dac517d0d2ba110fab1871a834","last_reissued_at":"2026-05-18T04:26:21.699577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:21.699577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the representability of totally unimodular matrices on bidirected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"B. Kotnyek, G. Appa, K. Papalamprou, L. Pitsoulis","submitted_at":"2009-01-07T18:03:13Z","abstract_excerpt":"Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called $k$-sums starting from network matrices and their transposes and two compact representation matrices $B_{1}, B_{2}$ of a certain ten element matroid. Given that $B_{1}, B_{2}$ are binet matrices we examine the $k$-sums of network and binet matrices. It is shown that the $k$-sum of a network and a binet matrix is a binet matrix, but binet matrices are not closed under this operation for $k=2,3$. A new class of matrices is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0885","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":"0901.0885","created_at":"2026-05-18T04:26:21.699667+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.0885v1","created_at":"2026-05-18T04:26:21.699667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0885","created_at":"2026-05-18T04:26:21.699667+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XES2443KO4S","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XES2443KO4SVOUA","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XES2443","created_at":"2026-05-18T12:25:58.837520+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/4XES2443KO4SVOUAGK65NLYL5X","json":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X.json","graph_json":"https://pith.science/api/pith-number/4XES2443KO4SVOUAGK65NLYL5X/graph.json","events_json":"https://pith.science/api/pith-number/4XES2443KO4SVOUAGK65NLYL5X/events.json","paper":"https://pith.science/paper/4XES2443"},"agent_actions":{"view_html":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X","download_json":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X.json","view_paper":"https://pith.science/paper/4XES2443","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.0885&json=true","fetch_graph":"https://pith.science/api/pith-number/4XES2443KO4SVOUAGK65NLYL5X/graph.json","fetch_events":"https://pith.science/api/pith-number/4XES2443KO4SVOUAGK65NLYL5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/action/storage_attestation","attest_author":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/action/author_attestation","sign_citation":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/action/citation_signature","submit_replication":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/action/replication_record"}},"created_at":"2026-05-18T04:26:21.699667+00:00","updated_at":"2026-05-18T04:26:21.699667+00:00"}