{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y5Q3OGDFH3HX6Q5FTESDO5G3XL","short_pith_number":"pith:Y5Q3OGDF","canonical_record":{"source":{"id":"1901.00053","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T21:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"cfbf3ed4c55efbbd7b1d05f11d15bf614b4d60749c537a5a88e1701f16c96c76","abstract_canon_sha256":"909b609912f0e6166611a060f3d29a30ce0e50e7b298c33046986b13053b4cbf"},"schema_version":"1.0"},"canonical_sha256":"c761b718653ecf7f43a599243774dbbaeea739520a920c405d677d87922d377e","source":{"kind":"arxiv","id":"1901.00053","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00053","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00053v3","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00053","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"Y5Q3OGDFH3HX","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y5Q3OGDFH3HX6Q5F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y5Q3OGDF","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y5Q3OGDFH3HX6Q5FTESDO5G3XL","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00053","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T21:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"cfbf3ed4c55efbbd7b1d05f11d15bf614b4d60749c537a5a88e1701f16c96c76","abstract_canon_sha256":"909b609912f0e6166611a060f3d29a30ce0e50e7b298c33046986b13053b4cbf"},"schema_version":"1.0"},"canonical_sha256":"c761b718653ecf7f43a599243774dbbaeea739520a920c405d677d87922d377e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:03.672649Z","signature_b64":"fmbsWe83FjYeOlFl7uzVuJw/K6oU53WCZ8Dl/OfwR6keUk0tiUX9Dv/JOemRBlciaMAmwNU1lDUbGt8AfHPvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c761b718653ecf7f43a599243774dbbaeea739520a920c405d677d87922d377e","last_reissued_at":"2026-05-17T23:46:03.671850Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:03.671850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00053","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-17T23:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P21C8QlWYGJepDDUPrXhL5yqwdwzJFTTAkJvU22sZUE0f2OOR++Hzo6R6Nt8wB2zNHFw609+mjr9zRS2aKLMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:36.236344Z"},"content_sha256":"7e101e5cb01d39fe3909c328a0be12cf60bd9d13aee1f43429dbbdcd00dee35b","schema_version":"1.0","event_id":"sha256:7e101e5cb01d39fe3909c328a0be12cf60bd9d13aee1f43429dbbdcd00dee35b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y5Q3OGDFH3HX6Q5FTESDO5G3XL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning 2-Forests and Resistance Distance in 2-Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda E. Francis, Emily J. Evans, John Sinkovic, Mark Kempton, Wayne Barrett","submitted_at":"2018-12-31T21:54:20Z","abstract_excerpt":"A spanning 2-forest separating vertices $u$ and $v$ of an undirected connected graph is a spanning forest with 2 components such that $u$ and $v$ are in distinct components. Aside from their combinatorial significance, spanning 2-forests have an important application to the calculation of resistance distance or effective resistance. The resistance distance between vertices $u$ and $v$ in a graph representing an electrical circuit with unit resistance on each edge is the number of spanning 2-forests separating $u$ and $v$ divided by the number of spanning trees in the graph. There are also well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00053","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-17T23:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjuFy8obRPy2IcoA+/ylcoBemEg7bKdmRJQwVuzm4Vt6gZpET2tRMMYPWrK+ZO5ezDCjn6z1kjuqNBfnZBoNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:19:36.236703Z"},"content_sha256":"c70ffad7a28228bae1c72872b7355ca06f60a0e421b11881a14b410b4d7feccb","schema_version":"1.0","event_id":"sha256:c70ffad7a28228bae1c72872b7355ca06f60a0e421b11881a14b410b4d7feccb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL/bundle.json","state_url":"https://pith.science/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL/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-27T19:19:36Z","links":{"resolver":"https://pith.science/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL","bundle":"https://pith.science/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL/bundle.json","state":"https://pith.science/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5Q3OGDFH3HX6Q5FTESDO5G3XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y5Q3OGDFH3HX6Q5FTESDO5G3XL","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":"909b609912f0e6166611a060f3d29a30ce0e50e7b298c33046986b13053b4cbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T21:54:20Z","title_canon_sha256":"cfbf3ed4c55efbbd7b1d05f11d15bf614b4d60749c537a5a88e1701f16c96c76"},"schema_version":"1.0","source":{"id":"1901.00053","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00053","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00053v3","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00053","created_at":"2026-05-17T23:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"Y5Q3OGDFH3HX","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y5Q3OGDFH3HX6Q5F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y5Q3OGDF","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:c70ffad7a28228bae1c72872b7355ca06f60a0e421b11881a14b410b4d7feccb","target":"graph","created_at":"2026-05-17T23:46:03Z","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":"A spanning 2-forest separating vertices $u$ and $v$ of an undirected connected graph is a spanning forest with 2 components such that $u$ and $v$ are in distinct components. Aside from their combinatorial significance, spanning 2-forests have an important application to the calculation of resistance distance or effective resistance. The resistance distance between vertices $u$ and $v$ in a graph representing an electrical circuit with unit resistance on each edge is the number of spanning 2-forests separating $u$ and $v$ divided by the number of spanning trees in the graph. There are also well","authors_text":"Amanda E. Francis, Emily J. Evans, John Sinkovic, Mark Kempton, Wayne Barrett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T21:54:20Z","title":"Spanning 2-Forests and Resistance Distance in 2-Connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00053","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:7e101e5cb01d39fe3909c328a0be12cf60bd9d13aee1f43429dbbdcd00dee35b","target":"record","created_at":"2026-05-17T23:46:03Z","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":"909b609912f0e6166611a060f3d29a30ce0e50e7b298c33046986b13053b4cbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T21:54:20Z","title_canon_sha256":"cfbf3ed4c55efbbd7b1d05f11d15bf614b4d60749c537a5a88e1701f16c96c76"},"schema_version":"1.0","source":{"id":"1901.00053","kind":"arxiv","version":3}},"canonical_sha256":"c761b718653ecf7f43a599243774dbbaeea739520a920c405d677d87922d377e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c761b718653ecf7f43a599243774dbbaeea739520a920c405d677d87922d377e","first_computed_at":"2026-05-17T23:46:03.671850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:03.671850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmbsWe83FjYeOlFl7uzVuJw/K6oU53WCZ8Dl/OfwR6keUk0tiUX9Dv/JOemRBlciaMAmwNU1lDUbGt8AfHPvCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:03.672649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00053","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e101e5cb01d39fe3909c328a0be12cf60bd9d13aee1f43429dbbdcd00dee35b","sha256:c70ffad7a28228bae1c72872b7355ca06f60a0e421b11881a14b410b4d7feccb"],"state_sha256":"9c7715975252be91de86b89b3d7e3362e1ff3c4886e20b29f683aa3ed9104f1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/tk0PJpXX+tq14ZZfrd8A6DVec77f88WD3jE3qZyt2pdkSQG5qGmue+9sPWImxtX8ghrSV9ALw/jXe+5ElbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:19:36.239168Z","bundle_sha256":"2caa2cbb370600be83526fb9c6ea143beea2ed91c7f0bb51e030c7e43edd14bb"}}