{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TYPRF4RUJ24R2NB3PR5M7TFGSE","short_pith_number":"pith:TYPRF4RU","schema_version":"1.0","canonical_sha256":"9e1f12f2344eb91d343b7c7acfcca69134ec401f6406a9fff82f44003c47fa78","source":{"kind":"arxiv","id":"1311.1859","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.1859","created_at":"2026-05-18T03:07:42.828554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1859v1","created_at":"2026-05-18T03:07:42.828554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1859","created_at":"2026-05-18T03:07:42.828554+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYPRF4RUJ24R","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYPRF4RUJ24R2NB3","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYPRF4RU","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE","json":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE.json","graph_json":"https://pith.science/api/pith-number/TYPRF4RUJ24R2NB3PR5M7TFGSE/graph.json","events_json":"https://pith.science/api/pith-number/TYPRF4RUJ24R2NB3PR5M7TFGSE/events.json","paper":"https://pith.science/paper/TYPRF4RU"},"agent_actions":{"view_html":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE","download_json":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE.json","view_paper":"https://pith.science/paper/TYPRF4RU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1859&json=true","fetch_graph":"https://pith.science/api/pith-number/TYPRF4RUJ24R2NB3PR5M7TFGSE/graph.json","fetch_events":"https://pith.science/api/pith-number/TYPRF4RUJ24R2NB3PR5M7TFGSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/action/storage_attestation","attest_author":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/action/author_attestation","sign_citation":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/action/citation_signature","submit_replication":"https://pith.science/pith/TYPRF4RUJ24R2NB3PR5M7TFGSE/action/replication_record"}},"created_at":"2026-05-18T03:07:42.828554+00:00","updated_at":"2026-05-18T03:07:42.828554+00:00"}