{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:635GA6GKGL2DSKOTUDKE5LYHNQ","short_pith_number":"pith:635GA6GK","schema_version":"1.0","canonical_sha256":"f6fa6078ca32f43929d3a0d44eaf076c1ebfc2a35770b3e7a9fcb61badd68270","source":{"kind":"arxiv","id":"1312.0497","version":1},"attestation_state":"computed","paper":{"title":"Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Frank Hellweg","submitted_at":"2013-12-02T16:17:22Z","abstract_excerpt":"We study property testing in directed graphs in the bounded degree model, where we assume that an algorithm may only query the outgoing edges of a vertex, a model proposed by Bender and Ron in 2002. As our first main result, we we present a property testing algorithm for strong connectivity in this model, having a query complexity of $\\mathcal{O}(n^{1-\\epsilon/(3+\\alpha)})$ for arbitrary $\\alpha>0$; it is based on a reduction to estimating the vertex indegree distribution. For subgraph-freeness we give a property testing algorithm with a query complexity of $\\mathcal{O}(n^{1-1/k})$, where $k$ "},"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":"1312.0497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T16:17:22Z","cross_cats_sorted":[],"title_canon_sha256":"02f59f856b381dc68ef7e5d70141fdcc41cab9ad3561ebb224967e17c0d5728a","abstract_canon_sha256":"19f09b6d01b155852fedf8b566dd6fb9d8209a7aa6f4430f2d66da85118669e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.522978Z","signature_b64":"rNx6kMIU2rl1wHcLdt8Kzyp/ko9VievEuGvauv7i37KMXG8y4S6lDQVSLbCLQunsnnAwswScGLTMeZr3QSaaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6fa6078ca32f43929d3a0d44eaf076c1ebfc2a35770b3e7a9fcb61badd68270","last_reissued_at":"2026-05-18T03:05:45.522491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.522491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Frank Hellweg","submitted_at":"2013-12-02T16:17:22Z","abstract_excerpt":"We study property testing in directed graphs in the bounded degree model, where we assume that an algorithm may only query the outgoing edges of a vertex, a model proposed by Bender and Ron in 2002. As our first main result, we we present a property testing algorithm for strong connectivity in this model, having a query complexity of $\\mathcal{O}(n^{1-\\epsilon/(3+\\alpha)})$ for arbitrary $\\alpha>0$; it is based on a reduction to estimating the vertex indegree distribution. For subgraph-freeness we give a property testing algorithm with a query complexity of $\\mathcal{O}(n^{1-1/k})$, where $k$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0497","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":"1312.0497","created_at":"2026-05-18T03:05:45.522565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0497v1","created_at":"2026-05-18T03:05:45.522565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0497","created_at":"2026-05-18T03:05:45.522565+00:00"},{"alias_kind":"pith_short_12","alias_value":"635GA6GKGL2D","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"635GA6GKGL2DSKOT","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"635GA6GK","created_at":"2026-05-18T12:27:34.582898+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/635GA6GKGL2DSKOTUDKE5LYHNQ","json":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ.json","graph_json":"https://pith.science/api/pith-number/635GA6GKGL2DSKOTUDKE5LYHNQ/graph.json","events_json":"https://pith.science/api/pith-number/635GA6GKGL2DSKOTUDKE5LYHNQ/events.json","paper":"https://pith.science/paper/635GA6GK"},"agent_actions":{"view_html":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ","download_json":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ.json","view_paper":"https://pith.science/paper/635GA6GK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0497&json=true","fetch_graph":"https://pith.science/api/pith-number/635GA6GKGL2DSKOTUDKE5LYHNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/635GA6GKGL2DSKOTUDKE5LYHNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/action/storage_attestation","attest_author":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/action/author_attestation","sign_citation":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/action/citation_signature","submit_replication":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/action/replication_record"}},"created_at":"2026-05-18T03:05:45.522565+00:00","updated_at":"2026-05-18T03:05:45.522565+00:00"}