{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TYPRF4RUJ24R2NB3PR5M7TFGSE","short_pith_number":"pith:TYPRF4RU","canonical_record":{"source":{"id":"1311.1859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T01:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"7d838e1c31411b405f156c5e45e54e57324adbb5fba9043e0cdd83027e371bbe","abstract_canon_sha256":"813db7ff1a211acd90f098f4f65deb246c0c5c3b770283dad1d49aa6fe48ccf6"},"schema_version":"1.0"},"canonical_sha256":"9e1f12f2344eb91d343b7c7acfcca69134ec401f6406a9fff82f44003c47fa78","source":{"kind":"arxiv","id":"1311.1859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1859","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1859v1","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1859","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"TYPRF4RUJ24R","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYPRF4RUJ24R2NB3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYPRF4RU","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TYPRF4RUJ24R2NB3PR5M7TFGSE","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T01:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"7d838e1c31411b405f156c5e45e54e57324adbb5fba9043e0cdd83027e371bbe","abstract_canon_sha256":"813db7ff1a211acd90f098f4f65deb246c0c5c3b770283dad1d49aa6fe48ccf6"},"schema_version":"1.0"},"canonical_sha256":"9e1f12f2344eb91d343b7c7acfcca69134ec401f6406a9fff82f44003c47fa78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:42.829051Z","signature_b64":"DK2ROJmpRkC7/6sJ9rs7Kj//MOR8OALN8FlIMzffMHBfloOn2mvzGazG7Rhh2Ofy6CR1JaUBImNVZnM+dT4qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e1f12f2344eb91d343b7c7acfcca69134ec401f6406a9fff82f44003c47fa78","last_reissued_at":"2026-05-18T03:07:42.828464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:42.828464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1859","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:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ecPN/KPtHS3lHAycf805URsDfmOb0BLn7j6d02sNKdI6Vmn12OXvyIYY+Ahe3b/70rfSfE1o5CEPy3qZbZIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:28:47.816339Z"},"content_sha256":"f74347ca10b4ebf92543687278ea7f93d51d24e0ddb3a916e9ab915b9b0f1c10","schema_version":"1.0","event_id":"sha256:f74347ca10b4ebf92543687278ea7f93d51d24e0ddb3a916e9ab915b9b0f1c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TYPRF4RUJ24R2NB3PR5M7TFGSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benson Joeris, Nathan Lindzey, Nissa Osheim, Ross M. McConnell","submitted_at":"2013-11-08T01:08:10Z","abstract_excerpt":"A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph $\\widetilde{G}$ is a digraph obtained from a sequence of vertex complement operations on $G$. Dahlhaus et al. showed that, given an adjacency-list representation of $\\widetilde{G}$, depth-first search (DFS) on $G$ can be performed in $O(n + \\widetilde{m})$ time, where $n$ is the number of vertices and $\\widetilde{m}$ is the number of edges in $\\widetilde{G}$. To achieve this bound, their algorithm makes use of a somewhat complicated sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1859","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:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE01v5CueV10zaYf+pysnBZm1nDb9vxDCUC7wQAn8h9YCaixMKcMBIzci5kQbrvZ6/eqtjo5+xNHFOTPXcigAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:28:47.816684Z"},"content_sha256":"8d8bd7a60a64758fdec0301e2fe142857b8b4a04d508f24d9397d20925dee820","schema_version":"1.0","event_id":"sha256:8d8bd7a60a64758fdec0301e2fe142857b8b4a04d508f24d9397d20925dee820"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/bundle.json","state_url":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/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-01T07:28:47Z","links":{"resolver":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE","bundle":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/bundle.json","state":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TYPRF4RUJ24R2NB3PR5M7TFGSE","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":"813db7ff1a211acd90f098f4f65deb246c0c5c3b770283dad1d49aa6fe48ccf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T01:08:10Z","title_canon_sha256":"7d838e1c31411b405f156c5e45e54e57324adbb5fba9043e0cdd83027e371bbe"},"schema_version":"1.0","source":{"id":"1311.1859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1859","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1859v1","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1859","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"TYPRF4RUJ24R","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYPRF4RUJ24R2NB3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYPRF4RU","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:8d8bd7a60a64758fdec0301e2fe142857b8b4a04d508f24d9397d20925dee820","target":"graph","created_at":"2026-05-18T03:07:42Z","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 complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph $\\widetilde{G}$ is a digraph obtained from a sequence of vertex complement operations on $G$. Dahlhaus et al. showed that, given an adjacency-list representation of $\\widetilde{G}$, depth-first search (DFS) on $G$ can be performed in $O(n + \\widetilde{m})$ time, where $n$ is the number of vertices and $\\widetilde{m}$ is the number of edges in $\\widetilde{G}$. To achieve this bound, their algorithm makes use of a somewhat complicated sta","authors_text":"Benson Joeris, Nathan Lindzey, Nissa Osheim, Ross M. McConnell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T01:08:10Z","title":"Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1859","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:f74347ca10b4ebf92543687278ea7f93d51d24e0ddb3a916e9ab915b9b0f1c10","target":"record","created_at":"2026-05-18T03:07:42Z","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":"813db7ff1a211acd90f098f4f65deb246c0c5c3b770283dad1d49aa6fe48ccf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T01:08:10Z","title_canon_sha256":"7d838e1c31411b405f156c5e45e54e57324adbb5fba9043e0cdd83027e371bbe"},"schema_version":"1.0","source":{"id":"1311.1859","kind":"arxiv","version":1}},"canonical_sha256":"9e1f12f2344eb91d343b7c7acfcca69134ec401f6406a9fff82f44003c47fa78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e1f12f2344eb91d343b7c7acfcca69134ec401f6406a9fff82f44003c47fa78","first_computed_at":"2026-05-18T03:07:42.828464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:42.828464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DK2ROJmpRkC7/6sJ9rs7Kj//MOR8OALN8FlIMzffMHBfloOn2mvzGazG7Rhh2Ofy6CR1JaUBImNVZnM+dT4qDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:42.829051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f74347ca10b4ebf92543687278ea7f93d51d24e0ddb3a916e9ab915b9b0f1c10","sha256:8d8bd7a60a64758fdec0301e2fe142857b8b4a04d508f24d9397d20925dee820"],"state_sha256":"8bf1f97b63576279ff7067e8921d571c244e2af6e059c585581d2df89392850d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hPeLYZfy1Xd1/zyaEzXNlgs4UEq+nFgBRHGw2E/Hs9a5Kz0WaiodKxuBiJe3uX66gALtp+j3i1LQh8GW9dfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:28:47.818544Z","bundle_sha256":"45a32f55e8ec903daf8320ccab4caba47539f33703e4b1a68a788cfeff568886"}}