{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JQ66WJOBSLZAON5EZGQV6O2S6X","short_pith_number":"pith:JQ66WJOB","canonical_record":{"source":{"id":"1601.03526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T09:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"f3edc4e37daf0d8a5baa97334b7714fa861fb7ec58005edd9531cee3cbc5c84f","abstract_canon_sha256":"304b96de69998e9f861afd81bfc7f08d9ac2eede4339aa63906f99d87503c6c7"},"schema_version":"1.0"},"canonical_sha256":"4c3deb25c192f20737a4c9a15f3b52f5d214093f2f3d2df0bea7494b4e91dee0","source":{"kind":"arxiv","id":"1601.03526","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03526","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03526v3","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03526","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"JQ66WJOBSLZA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JQ66WJOBSLZAON5E","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JQ66WJOB","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JQ66WJOBSLZAON5EZGQV6O2S6X","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T09:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"f3edc4e37daf0d8a5baa97334b7714fa861fb7ec58005edd9531cee3cbc5c84f","abstract_canon_sha256":"304b96de69998e9f861afd81bfc7f08d9ac2eede4339aa63906f99d87503c6c7"},"schema_version":"1.0"},"canonical_sha256":"4c3deb25c192f20737a4c9a15f3b52f5d214093f2f3d2df0bea7494b4e91dee0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:06.389925Z","signature_b64":"TPvpFo90f+sPNvHyBvqobeW2kUHWgEY4zRGBsg7g+OpIvQr1hGtkynkz2RNJTsdmoBRwHDxlAZCsm5iK0WfwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3deb25c192f20737a4c9a15f3b52f5d214093f2f3d2df0bea7494b4e91dee0","last_reissued_at":"2026-05-18T01:15:06.389297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:06.389297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03526","source_version":3,"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-18T01:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYjTjlqfY2QZzxVRqPlHwDIb3T57mkOSnZOYqfHprlP0L2CQ8yrPa0dyz47WfXQ2MSzZg490w0WX31dFiR2vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:51:32.007832Z"},"content_sha256":"4b56bf427419c2803eb35fe851bdfb5d3c879a20097bd03b01259b3f5938aff1","schema_version":"1.0","event_id":"sha256:4b56bf427419c2803eb35fe851bdfb5d3c879a20097bd03b01259b3f5938aff1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JQ66WJOBSLZAON5EZGQV6O2S6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Structure of the Graph of Unique Symmetric Base Exchanges of Bispanning Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Timo Bingmann","submitted_at":"2016-01-14T09:36:11Z","abstract_excerpt":"Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint spanning trees, is called an edge exchange or a symmetric base exchange. The graph of symmetric base exchanges of a bispanning graph contains a vertex for every valid pair of disjoint spanning trees, and edges between them to represent all possible edge exchanges. We are interested in a restriction of these graphs to only unique symmetric base exchanges, which a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03526","kind":"arxiv","version":3},"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-18T01:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ST/kNEFIpH/dxeFNpJi1oISK/zkvyHFlMJNWuYmHmGqMdpDugHaKp8h3gWzf3ouKFQzp4FgzT6XEN77KFv0YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:51:32.008180Z"},"content_sha256":"df14793b06ce7c7408cf5b511e026139eadbb0bbab865af3d0c4e1179ac17d7f","schema_version":"1.0","event_id":"sha256:df14793b06ce7c7408cf5b511e026139eadbb0bbab865af3d0c4e1179ac17d7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQ66WJOBSLZAON5EZGQV6O2S6X/bundle.json","state_url":"https://pith.science/pith/JQ66WJOBSLZAON5EZGQV6O2S6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQ66WJOBSLZAON5EZGQV6O2S6X/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-05-24T12:51:32Z","links":{"resolver":"https://pith.science/pith/JQ66WJOBSLZAON5EZGQV6O2S6X","bundle":"https://pith.science/pith/JQ66WJOBSLZAON5EZGQV6O2S6X/bundle.json","state":"https://pith.science/pith/JQ66WJOBSLZAON5EZGQV6O2S6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQ66WJOBSLZAON5EZGQV6O2S6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JQ66WJOBSLZAON5EZGQV6O2S6X","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":"304b96de69998e9f861afd81bfc7f08d9ac2eede4339aa63906f99d87503c6c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T09:36:11Z","title_canon_sha256":"f3edc4e37daf0d8a5baa97334b7714fa861fb7ec58005edd9531cee3cbc5c84f"},"schema_version":"1.0","source":{"id":"1601.03526","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03526","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03526v3","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03526","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"JQ66WJOBSLZA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JQ66WJOBSLZAON5E","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JQ66WJOB","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:df14793b06ce7c7408cf5b511e026139eadbb0bbab865af3d0c4e1179ac17d7f","target":"graph","created_at":"2026-05-18T01:15:06Z","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":"Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint spanning trees, is called an edge exchange or a symmetric base exchange. The graph of symmetric base exchanges of a bispanning graph contains a vertex for every valid pair of disjoint spanning trees, and edges between them to represent all possible edge exchanges. We are interested in a restriction of these graphs to only unique symmetric base exchanges, which a","authors_text":"Timo Bingmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T09:36:11Z","title":"On the Structure of the Graph of Unique Symmetric Base Exchanges of Bispanning Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03526","kind":"arxiv","version":3},"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:4b56bf427419c2803eb35fe851bdfb5d3c879a20097bd03b01259b3f5938aff1","target":"record","created_at":"2026-05-18T01:15:06Z","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":"304b96de69998e9f861afd81bfc7f08d9ac2eede4339aa63906f99d87503c6c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T09:36:11Z","title_canon_sha256":"f3edc4e37daf0d8a5baa97334b7714fa861fb7ec58005edd9531cee3cbc5c84f"},"schema_version":"1.0","source":{"id":"1601.03526","kind":"arxiv","version":3}},"canonical_sha256":"4c3deb25c192f20737a4c9a15f3b52f5d214093f2f3d2df0bea7494b4e91dee0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c3deb25c192f20737a4c9a15f3b52f5d214093f2f3d2df0bea7494b4e91dee0","first_computed_at":"2026-05-18T01:15:06.389297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:06.389297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TPvpFo90f+sPNvHyBvqobeW2kUHWgEY4zRGBsg7g+OpIvQr1hGtkynkz2RNJTsdmoBRwHDxlAZCsm5iK0WfwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:06.389925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03526","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b56bf427419c2803eb35fe851bdfb5d3c879a20097bd03b01259b3f5938aff1","sha256:df14793b06ce7c7408cf5b511e026139eadbb0bbab865af3d0c4e1179ac17d7f"],"state_sha256":"a407b18d7f7be249d0593e9e4723396b54e57e19f80600fbdb7770b228381a4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSCyJNRUBqtPLF9lPGtTfoLxVowTqTg6ZlSE3MB2iBJB2kViO0UBuPqoTtReADLiYLlGg5XKxvB8r6PHT84xBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T12:51:32.010672Z","bundle_sha256":"901c9790a1925127b7ad13b5e053a6ba5764656b55e93d8f1fec01f50add5849"}}