{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:635GA6GKGL2DSKOTUDKE5LYHNQ","short_pith_number":"pith:635GA6GK","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"},"canonical_sha256":"f6fa6078ca32f43929d3a0d44eaf076c1ebfc2a35770b3e7a9fcb61badd68270","source":{"kind":"arxiv","id":"1312.0497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0497","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0497v1","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0497","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"635GA6GKGL2D","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"635GA6GKGL2DSKOT","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"635GA6GK","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:635GA6GKGL2DSKOTUDKE5LYHNQ","target":"record","payload":{"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"},"canonical_sha256":"f6fa6078ca32f43929d3a0d44eaf076c1ebfc2a35770b3e7a9fcb61badd68270","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"},"source_kind":"arxiv","source_id":"1312.0497","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:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/DxYOxpVcrrU46h4yJNPblFL9UoJjsHtx3khxsvpZYsOWyU6DvJE9ti2LBnLgtDFE1AN5HAXrwfP0i0qTwQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:44:03.530409Z"},"content_sha256":"ef32ef386c2ea4bc5a63f73506bde208c2df014603784a2324c721b90db117aa","schema_version":"1.0","event_id":"sha256:ef32ef386c2ea4bc5a63f73506bde208c2df014603784a2324c721b90db117aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:635GA6GKGL2DSKOTUDKE5LYHNQ","target":"graph","payload":{"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"},"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:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpkZnzS8l9R3x5OXzbGayOq+hbANxv37hEGM8d5rOEt7io/RYKrtpyjHhWQtX8expV/vJg+sIrZN44ogw1mgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:44:03.530772Z"},"content_sha256":"36e8067afcfec0c1631b8738b9069a03a2d016fea83de435db7408ee05581dfd","schema_version":"1.0","event_id":"sha256:36e8067afcfec0c1631b8738b9069a03a2d016fea83de435db7408ee05581dfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/bundle.json","state_url":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/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-05-27T23:44:03Z","links":{"resolver":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ","bundle":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/bundle.json","state":"https://pith.science/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/635GA6GKGL2DSKOTUDKE5LYHNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:635GA6GKGL2DSKOTUDKE5LYHNQ","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":"19f09b6d01b155852fedf8b566dd6fb9d8209a7aa6f4430f2d66da85118669e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T16:17:22Z","title_canon_sha256":"02f59f856b381dc68ef7e5d70141fdcc41cab9ad3561ebb224967e17c0d5728a"},"schema_version":"1.0","source":{"id":"1312.0497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0497","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0497v1","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0497","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"635GA6GKGL2D","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"635GA6GKGL2DSKOT","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"635GA6GK","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:36e8067afcfec0c1631b8738b9069a03a2d016fea83de435db7408ee05581dfd","target":"graph","created_at":"2026-05-18T03:05:45Z","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":"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$ ","authors_text":"Christian Sohler, Frank Hellweg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T16:17:22Z","title":"Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0497","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:ef32ef386c2ea4bc5a63f73506bde208c2df014603784a2324c721b90db117aa","target":"record","created_at":"2026-05-18T03:05:45Z","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":"19f09b6d01b155852fedf8b566dd6fb9d8209a7aa6f4430f2d66da85118669e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-02T16:17:22Z","title_canon_sha256":"02f59f856b381dc68ef7e5d70141fdcc41cab9ad3561ebb224967e17c0d5728a"},"schema_version":"1.0","source":{"id":"1312.0497","kind":"arxiv","version":1}},"canonical_sha256":"f6fa6078ca32f43929d3a0d44eaf076c1ebfc2a35770b3e7a9fcb61badd68270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6fa6078ca32f43929d3a0d44eaf076c1ebfc2a35770b3e7a9fcb61badd68270","first_computed_at":"2026-05-18T03:05:45.522491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.522491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rNx6kMIU2rl1wHcLdt8Kzyp/ko9VievEuGvauv7i37KMXG8y4S6lDQVSLbCLQunsnnAwswScGLTMeZr3QSaaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.522978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef32ef386c2ea4bc5a63f73506bde208c2df014603784a2324c721b90db117aa","sha256:36e8067afcfec0c1631b8738b9069a03a2d016fea83de435db7408ee05581dfd"],"state_sha256":"32c867975c1a414a0ee1b5e976f1d75a7f8aac13dd691fe1c07e026a5f18f71b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dvgc9Fxa3IP8SYHkAQTSO378M1i3sj4weVEsWVxB8SC8XC98zQutESaGgUzBQHCZwY7K6saSx3zkmCXU95qiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:44:03.532998Z","bundle_sha256":"af20f3faf0c61f69067e36afc97958e24099a2496d4e6ca7503b7a5843ce4125"}}