{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:4XES2443KO4SVOUAGK65NLYL5X","short_pith_number":"pith:4XES2443","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"},"canonical_sha256":"e5c92d739b53b92aba8032bdd6af0bedc528f8dac517d0d2ba110fab1871a834","source":{"kind":"arxiv","id":"0901.0885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0885","created_at":"2026-05-18T04:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0885v1","created_at":"2026-05-18T04:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0885","created_at":"2026-05-18T04:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"4XES2443KO4S","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4XES2443KO4SVOUA","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4XES2443","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:4XES2443KO4SVOUAGK65NLYL5X","target":"record","payload":{"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"},"canonical_sha256":"e5c92d739b53b92aba8032bdd6af0bedc528f8dac517d0d2ba110fab1871a834","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"},"source_kind":"arxiv","source_id":"0901.0885","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmgdO80xav8W7FvWlfaN32/pKlCuB6Gafx4oOpo3AbPlcMY66bKdX9RbItujGNnRevlNwEaBapijKZCjK7jDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:24:03.836805Z"},"content_sha256":"7814defa657481bff274dec1c927513fe148c0f3d833ae0a48fc7be6d4272c5a","schema_version":"1.0","event_id":"sha256:7814defa657481bff274dec1c927513fe148c0f3d833ae0a48fc7be6d4272c5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:4XES2443KO4SVOUAGK65NLYL5X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yf6Cgf3wG3MsJ2wl4OsYF+7LqJg+XVJQvcFFBXwk7Fv22+FUSyTOTWv8WdaWzp2alyzRGZ98NnVPI+b2ZEIjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:24:03.837149Z"},"content_sha256":"b168e247b670d17f48def7041c42ac972ba81b73cae82b7e4bae0b002fec3cdf","schema_version":"1.0","event_id":"sha256:b168e247b670d17f48def7041c42ac972ba81b73cae82b7e4bae0b002fec3cdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/bundle.json","state_url":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XES2443KO4SVOUAGK65NLYL5X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T12:24:03Z","links":{"resolver":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X","bundle":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/bundle.json","state":"https://pith.science/pith/4XES2443KO4SVOUAGK65NLYL5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XES2443KO4SVOUAGK65NLYL5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:4XES2443KO4SVOUAGK65NLYL5X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c1764fd75ab4231dae24483e3d3bbb2fc71c826f7ac430d79a39efba16a55468","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T18:03:13Z","title_canon_sha256":"11948caea71f4aa0f2896e2cbb3db1eb98b84b9d2c032b88f63547c98dd09c71"},"schema_version":"1.0","source":{"id":"0901.0885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0885","created_at":"2026-05-18T04:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0885v1","created_at":"2026-05-18T04:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0885","created_at":"2026-05-18T04:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"4XES2443KO4S","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"4XES2443KO4SVOUA","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"4XES2443","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:b168e247b670d17f48def7041c42ac972ba81b73cae82b7e4bae0b002fec3cdf","target":"graph","created_at":"2026-05-18T04:26:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"B. Kotnyek, G. Appa, K. Papalamprou, L. Pitsoulis","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T18:03:13Z","title":"On the representability of totally unimodular matrices on bidirected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0885","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7814defa657481bff274dec1c927513fe148c0f3d833ae0a48fc7be6d4272c5a","target":"record","created_at":"2026-05-18T04:26:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c1764fd75ab4231dae24483e3d3bbb2fc71c826f7ac430d79a39efba16a55468","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-01-07T18:03:13Z","title_canon_sha256":"11948caea71f4aa0f2896e2cbb3db1eb98b84b9d2c032b88f63547c98dd09c71"},"schema_version":"1.0","source":{"id":"0901.0885","kind":"arxiv","version":1}},"canonical_sha256":"e5c92d739b53b92aba8032bdd6af0bedc528f8dac517d0d2ba110fab1871a834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5c92d739b53b92aba8032bdd6af0bedc528f8dac517d0d2ba110fab1871a834","first_computed_at":"2026-05-18T04:26:21.699577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:21.699577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KfCe2dHNH3Budh1MEiJdrzSefWRisar3ZA7FWDNVIO/ny41MyD+bHnFQVWRztv3pT/ZebIVRZRlakRydToKGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:21.700265Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.0885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7814defa657481bff274dec1c927513fe148c0f3d833ae0a48fc7be6d4272c5a","sha256:b168e247b670d17f48def7041c42ac972ba81b73cae82b7e4bae0b002fec3cdf"],"state_sha256":"e10e90c3f78fa33acc1b791069bd5c3c7e48e48d0ce3e1e69b715d0e01a5acec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdC09rTRJdSKrvGWhOkMHNDGLTL7ZRScgSAnL+Tw6kGWOS2/2s5Wvo5j01wFOaoBmCmdiv+PB29l1h96DbpDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:24:03.839251Z","bundle_sha256":"0d1599ee5f913df0651b2ec8b12519b46cd1658dc31a24043ed2f07e02f53817"}}