{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NEMMTJFVPGGEWFZKR6HFVRJU5Y","short_pith_number":"pith:NEMMTJFV","canonical_record":{"source":{"id":"1607.07073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-24T17:47:11Z","cross_cats_sorted":[],"title_canon_sha256":"277b4add4d3c1e47e0da87daf8765ae2f9ed9c62a8a57789e90852078859163e","abstract_canon_sha256":"ac2d58517849af1aa8c54c5eed698c2f6cafbbc3fb730e8c5c0b4c41fe44a93a"},"schema_version":"1.0"},"canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","source":{"kind":"arxiv","id":"1607.07073","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07073","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07073v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07073","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"NEMMTJFVPGGE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEMMTJFVPGGEWFZK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEMMTJFV","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NEMMTJFVPGGEWFZKR6HFVRJU5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-24T17:47:11Z","cross_cats_sorted":[],"title_canon_sha256":"277b4add4d3c1e47e0da87daf8765ae2f9ed9c62a8a57789e90852078859163e","abstract_canon_sha256":"ac2d58517849af1aa8c54c5eed698c2f6cafbbc3fb730e8c5c0b4c41fe44a93a"},"schema_version":"1.0"},"canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:34.893372Z","signature_b64":"cbo13fNUBU8w2PIJFDqbF4NeT69BPzzUS8ihhlkpF47MJO8qBYZDMU/65jfQVTi4EtVke6oKeJqY5PdP2eO4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","last_reissued_at":"2026-05-18T01:10:34.892833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:34.892833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07073","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-18T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvHo8eESqQfrTba6ElOBPWlOXUEuWrP0RmNCtpmSjz4yEsE332uAGaOpfmQQUCTAZmbJz+PNgJVCx3NgQTAdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:24:15.915495Z"},"content_sha256":"31a0f53b40fad459137d716f432c7f9feaffd1b1627dd68219f31a16bf6f2c8e","schema_version":"1.0","event_id":"sha256:31a0f53b40fad459137d716f432c7f9feaffd1b1627dd68219f31a16bf6f2c8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NEMMTJFVPGGEWFZKR6HFVRJU5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental $2$-Edge-Connectivity in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis","submitted_at":"2016-07-24T17:47:11Z","abstract_excerpt":"In this paper, we initiate the study of the dynamic maintenance of $2$-edge-connectivity relationships in directed graphs. We present an algorithm that can update the $2$-edge-connected blocks of a directed graph with $n$ vertices through a sequence of $m$ edge insertions in a total of $O(mn)$ time. After each insertion, we can answer the following queries in asymptotically optimal time: (i) Test in constant time if two query vertices $v$ and $w$ are $2$-edge-connected. Moreover, if $v$ and $w$ are not $2$-edge-connected, we can produce in constant time a \"witness\" of this property, by exhibit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07073","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-18T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9jmIqFyGCNVydwRTrfpqyVg0da66eBFVJwfvwA5jrwaHJWtnNmr6qO5jFdTraT54S+0B8SzgltkYzX9B5yuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:24:15.916092Z"},"content_sha256":"f537f4841ba8d1cf7d0dca022d28972e9c3624541daba129b88d68b800da5b71","schema_version":"1.0","event_id":"sha256:f537f4841ba8d1cf7d0dca022d28972e9c3624541daba129b88d68b800da5b71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/bundle.json","state_url":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/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-23T16:24:15Z","links":{"resolver":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y","bundle":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/bundle.json","state":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NEMMTJFVPGGEWFZKR6HFVRJU5Y","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":"ac2d58517849af1aa8c54c5eed698c2f6cafbbc3fb730e8c5c0b4c41fe44a93a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-24T17:47:11Z","title_canon_sha256":"277b4add4d3c1e47e0da87daf8765ae2f9ed9c62a8a57789e90852078859163e"},"schema_version":"1.0","source":{"id":"1607.07073","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07073","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07073v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07073","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"NEMMTJFVPGGE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEMMTJFVPGGEWFZK","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEMMTJFV","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:f537f4841ba8d1cf7d0dca022d28972e9c3624541daba129b88d68b800da5b71","target":"graph","created_at":"2026-05-18T01:10:34Z","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":"In this paper, we initiate the study of the dynamic maintenance of $2$-edge-connectivity relationships in directed graphs. We present an algorithm that can update the $2$-edge-connected blocks of a directed graph with $n$ vertices through a sequence of $m$ edge insertions in a total of $O(mn)$ time. After each insertion, we can answer the following queries in asymptotically optimal time: (i) Test in constant time if two query vertices $v$ and $w$ are $2$-edge-connected. Moreover, if $v$ and $w$ are not $2$-edge-connected, we can produce in constant time a \"witness\" of this property, by exhibit","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-24T17:47:11Z","title":"Incremental $2$-Edge-Connectivity in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07073","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:31a0f53b40fad459137d716f432c7f9feaffd1b1627dd68219f31a16bf6f2c8e","target":"record","created_at":"2026-05-18T01:10:34Z","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":"ac2d58517849af1aa8c54c5eed698c2f6cafbbc3fb730e8c5c0b4c41fe44a93a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-24T17:47:11Z","title_canon_sha256":"277b4add4d3c1e47e0da87daf8765ae2f9ed9c62a8a57789e90852078859163e"},"schema_version":"1.0","source":{"id":"1607.07073","kind":"arxiv","version":1}},"canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","first_computed_at":"2026-05-18T01:10:34.892833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:34.892833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cbo13fNUBU8w2PIJFDqbF4NeT69BPzzUS8ihhlkpF47MJO8qBYZDMU/65jfQVTi4EtVke6oKeJqY5PdP2eO4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:34.893372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07073","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31a0f53b40fad459137d716f432c7f9feaffd1b1627dd68219f31a16bf6f2c8e","sha256:f537f4841ba8d1cf7d0dca022d28972e9c3624541daba129b88d68b800da5b71"],"state_sha256":"1cfc3e667c2241c055b5c2b7984ceadec63ea33c5b17808f1f8e53a8d2714dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BuQageP63Dxq2OIU8PGocIMwhihfiRkYAGndSEor60eVq8YiFBeT3T4/Rym/4UDTOyi5UXOErRcbJ46zc4/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:24:15.918055Z","bundle_sha256":"8b6d9d8ea3c4240f0734bfba86d2ec4a3f30653efde715e555427d942450d0d4"}}