{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WPIBM5W6INBSA5OIQY3RYB7WCW","short_pith_number":"pith:WPIBM5W6","canonical_record":{"source":{"id":"1209.0700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T16:46:34Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6b2de2ca5c72a24b3b95c64499f0280edf1b4689e1d2a5c7af46b48c3c115b40","abstract_canon_sha256":"789ae2c7d149884ccfddc0bb37c493f61b39f521ab111ca7a3e41578a9942a77"},"schema_version":"1.0"},"canonical_sha256":"b3d01676de43432075c886371c07f61586d16f690ccf71ae8efde6760c3f7e95","source":{"kind":"arxiv","id":"1209.0700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0700","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0700v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0700","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"WPIBM5W6INBS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WPIBM5W6INBSA5OI","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WPIBM5W6","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WPIBM5W6INBSA5OIQY3RYB7WCW","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T16:46:34Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6b2de2ca5c72a24b3b95c64499f0280edf1b4689e1d2a5c7af46b48c3c115b40","abstract_canon_sha256":"789ae2c7d149884ccfddc0bb37c493f61b39f521ab111ca7a3e41578a9942a77"},"schema_version":"1.0"},"canonical_sha256":"b3d01676de43432075c886371c07f61586d16f690ccf71ae8efde6760c3f7e95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.422528Z","signature_b64":"CGZe/tomxioD00dbjCQEU0OI2hrj5P+e0ZyoVi9PIYTDKMAPLRgwv7fEhPngPy5h60oj+/Q46sW3Nx8tMZ1OBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d01676de43432075c886371c07f61586d16f690ccf71ae8efde6760c3f7e95","last_reissued_at":"2026-05-18T03:46:17.421901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.421901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0700","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odT2i3E/SsG7nckq32EK898tGKYnGw3sM8jOVIGr2tR2hPkImxHyEtTqJ2q4/bUIxUgUsGJG765+lD05wfDdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:27:43.659734Z"},"content_sha256":"f07e915774a4415c1329e869d1b1f00d3286153aeb70a6efc8b0d3dea3f37618","schema_version":"1.0","event_id":"sha256:f07e915774a4415c1329e869d1b1f00d3286153aeb70a6efc8b0d3dea3f37618"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WPIBM5W6INBSA5OIQY3RYB7WCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Test on 2-Vertex- and 2-Edge-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jens M. Schmidt","submitted_at":"2012-09-04T16:46:34Z","abstract_excerpt":"Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is presented that computes a structure from which both the 2-vertex- and 2-edge-connectivity of a graph can be easily \"read off\". The algorithm computes all bridges and cut vertices of the input graph in the same time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0700","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pm+ajnK/7k2nJFM25oTsONeZf+Rr4Eu0M+YrdZxzdhNSW1iG783NKfS5DVk//8EUOZzFo+xeLNESW4v95N2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:27:43.660082Z"},"content_sha256":"026c48fa6a84a9695783b71412f14ab9a47664f0a52bb5e040ead379447c0b3d","schema_version":"1.0","event_id":"sha256:026c48fa6a84a9695783b71412f14ab9a47664f0a52bb5e040ead379447c0b3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPIBM5W6INBSA5OIQY3RYB7WCW/bundle.json","state_url":"https://pith.science/pith/WPIBM5W6INBSA5OIQY3RYB7WCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPIBM5W6INBSA5OIQY3RYB7WCW/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-26T14:27:43Z","links":{"resolver":"https://pith.science/pith/WPIBM5W6INBSA5OIQY3RYB7WCW","bundle":"https://pith.science/pith/WPIBM5W6INBSA5OIQY3RYB7WCW/bundle.json","state":"https://pith.science/pith/WPIBM5W6INBSA5OIQY3RYB7WCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPIBM5W6INBSA5OIQY3RYB7WCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WPIBM5W6INBSA5OIQY3RYB7WCW","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":"789ae2c7d149884ccfddc0bb37c493f61b39f521ab111ca7a3e41578a9942a77","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T16:46:34Z","title_canon_sha256":"6b2de2ca5c72a24b3b95c64499f0280edf1b4689e1d2a5c7af46b48c3c115b40"},"schema_version":"1.0","source":{"id":"1209.0700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0700","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0700v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0700","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"WPIBM5W6INBS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WPIBM5W6INBSA5OI","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WPIBM5W6","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:026c48fa6a84a9695783b71412f14ab9a47664f0a52bb5e040ead379447c0b3d","target":"graph","created_at":"2026-05-18T03:46:17Z","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":"Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is presented that computes a structure from which both the 2-vertex- and 2-edge-connectivity of a graph can be easily \"read off\". The algorithm computes all bridges and cut vertices of the input graph in the same time.","authors_text":"Jens M. Schmidt","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T16:46:34Z","title":"A Simple Test on 2-Vertex- and 2-Edge-Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0700","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:f07e915774a4415c1329e869d1b1f00d3286153aeb70a6efc8b0d3dea3f37618","target":"record","created_at":"2026-05-18T03:46:17Z","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":"789ae2c7d149884ccfddc0bb37c493f61b39f521ab111ca7a3e41578a9942a77","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T16:46:34Z","title_canon_sha256":"6b2de2ca5c72a24b3b95c64499f0280edf1b4689e1d2a5c7af46b48c3c115b40"},"schema_version":"1.0","source":{"id":"1209.0700","kind":"arxiv","version":1}},"canonical_sha256":"b3d01676de43432075c886371c07f61586d16f690ccf71ae8efde6760c3f7e95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3d01676de43432075c886371c07f61586d16f690ccf71ae8efde6760c3f7e95","first_computed_at":"2026-05-18T03:46:17.421901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.421901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGZe/tomxioD00dbjCQEU0OI2hrj5P+e0ZyoVi9PIYTDKMAPLRgwv7fEhPngPy5h60oj+/Q46sW3Nx8tMZ1OBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.422528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f07e915774a4415c1329e869d1b1f00d3286153aeb70a6efc8b0d3dea3f37618","sha256:026c48fa6a84a9695783b71412f14ab9a47664f0a52bb5e040ead379447c0b3d"],"state_sha256":"11917fc1b9c45f263400895070487ffa50b1a202161c75b416845c5c2edfad7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xf7EA/odMPwd93p9laBpZGQUP/Hjm5tQ6nkaWyT90yF7x28ig9yqdrRf3RJ832ktfCqAwE7Vf9AJgggJECH0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:27:43.662059Z","bundle_sha256":"94fc4404f8aef3bc2d2449605811ad1169e59717eb188fd30c5685ff51964021"}}