{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:R5XH77MG7APVSTLCMOB2EODRZV","short_pith_number":"pith:R5XH77MG","canonical_record":{"source":{"id":"1007.4230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-23T23:34:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0a1a278b5685cb01becab1e2ba34b3dfda3a680fccb6278d6860d69fe28bff7","abstract_canon_sha256":"a0ee5c6bf3a68326b4478ff0ffd4e8216b4ad31b41640dfc62aaeae57bb9a422"},"schema_version":"1.0"},"canonical_sha256":"8f6e7ffd86f81f594d626383a23871cd662543b76a9926abfc2c00e451f45697","source":{"kind":"arxiv","id":"1007.4230","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4230","created_at":"2026-05-18T03:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4230v3","created_at":"2026-05-18T03:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4230","created_at":"2026-05-18T03:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"R5XH77MG7APV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R5XH77MG7APVSTLC","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R5XH77MG","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:R5XH77MG7APVSTLCMOB2EODRZV","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-23T23:34:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0a1a278b5685cb01becab1e2ba34b3dfda3a680fccb6278d6860d69fe28bff7","abstract_canon_sha256":"a0ee5c6bf3a68326b4478ff0ffd4e8216b4ad31b41640dfc62aaeae57bb9a422"},"schema_version":"1.0"},"canonical_sha256":"8f6e7ffd86f81f594d626383a23871cd662543b76a9926abfc2c00e451f45697","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:48.854147Z","signature_b64":"xgm+Hq1kLvMS50bZVnKU3njLC0xXLSxtuFVRTr06tSYIaK3eaInpeFJagnHFNX688x0HqihsVqF2LqSbddJFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f6e7ffd86f81f594d626383a23871cd662543b76a9926abfc2c00e451f45697","last_reissued_at":"2026-05-18T03:58:48.853322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:48.853322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4230","source_version":3,"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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYg4KGbwbERd1xB8xiNdFDOLgtVxfgHmGZ0kYNKfBOfWn41Qy554E/Jn/Zulx7RWHMIS9o9dPXc7TuBp26wZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:12.338003Z"},"content_sha256":"fbcfd9315579ece0a77c60d8a17e59f40da8a991f315fa156e46b343f7b55f76","schema_version":"1.0","event_id":"sha256:fbcfd9315579ece0a77c60d8a17e59f40da8a991f315fa156e46b343f7b55f76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:R5XH77MG7APVSTLCMOB2EODRZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Cycles and Trees in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Artur Czumaj, Asaf Shapira, Christian Sohler, C. Seshadhri, Dana Ron, Oded Goldreich","submitted_at":"2010-07-23T23:34:05Z","abstract_excerpt":"We present sublinear-time (randomized) algorithms for finding simple cycles of length at least $k\\geq 3$ and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being $C_k$-minor-free (resp., free from having the corresponding tree-minor). In particular, if the graph is far (i.e., $\\Omega(1)$-far) {from} being cycle-free, i.e. if one has to delete a constant fraction of edges to make it cycle-free, then the algorithm finds a cycle of polylogarithmic length in time $\\tildeO(\\sqrt{N})$, where $N$ denotes the number of vertices. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4230","kind":"arxiv","version":3},"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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gf7MYujWScoHex5b0qnrrkxbVC3JtQWkiofebNh/sVZpeWJk56EPSYj3PkxP9nSIbV9aOhxIVuP9vUEjURbxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:12.338670Z"},"content_sha256":"d9e93eb7275aceb98c6c71d968e452d785f33412cee280127f8e6b28629581c3","schema_version":"1.0","event_id":"sha256:d9e93eb7275aceb98c6c71d968e452d785f33412cee280127f8e6b28629581c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5XH77MG7APVSTLCMOB2EODRZV/bundle.json","state_url":"https://pith.science/pith/R5XH77MG7APVSTLCMOB2EODRZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5XH77MG7APVSTLCMOB2EODRZV/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-27T07:34:12Z","links":{"resolver":"https://pith.science/pith/R5XH77MG7APVSTLCMOB2EODRZV","bundle":"https://pith.science/pith/R5XH77MG7APVSTLCMOB2EODRZV/bundle.json","state":"https://pith.science/pith/R5XH77MG7APVSTLCMOB2EODRZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5XH77MG7APVSTLCMOB2EODRZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R5XH77MG7APVSTLCMOB2EODRZV","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":"a0ee5c6bf3a68326b4478ff0ffd4e8216b4ad31b41640dfc62aaeae57bb9a422","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-23T23:34:05Z","title_canon_sha256":"e0a1a278b5685cb01becab1e2ba34b3dfda3a680fccb6278d6860d69fe28bff7"},"schema_version":"1.0","source":{"id":"1007.4230","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4230","created_at":"2026-05-18T03:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4230v3","created_at":"2026-05-18T03:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4230","created_at":"2026-05-18T03:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"R5XH77MG7APV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R5XH77MG7APVSTLC","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R5XH77MG","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:d9e93eb7275aceb98c6c71d968e452d785f33412cee280127f8e6b28629581c3","target":"graph","created_at":"2026-05-18T03:58:48Z","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 present sublinear-time (randomized) algorithms for finding simple cycles of length at least $k\\geq 3$ and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being $C_k$-minor-free (resp., free from having the corresponding tree-minor). In particular, if the graph is far (i.e., $\\Omega(1)$-far) {from} being cycle-free, i.e. if one has to delete a constant fraction of edges to make it cycle-free, then the algorithm finds a cycle of polylogarithmic length in time $\\tildeO(\\sqrt{N})$, where $N$ denotes the number of vertices. Th","authors_text":"Artur Czumaj, Asaf Shapira, Christian Sohler, C. Seshadhri, Dana Ron, Oded Goldreich","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-23T23:34:05Z","title":"Finding Cycles and Trees in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4230","kind":"arxiv","version":3},"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:fbcfd9315579ece0a77c60d8a17e59f40da8a991f315fa156e46b343f7b55f76","target":"record","created_at":"2026-05-18T03:58:48Z","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":"a0ee5c6bf3a68326b4478ff0ffd4e8216b4ad31b41640dfc62aaeae57bb9a422","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-23T23:34:05Z","title_canon_sha256":"e0a1a278b5685cb01becab1e2ba34b3dfda3a680fccb6278d6860d69fe28bff7"},"schema_version":"1.0","source":{"id":"1007.4230","kind":"arxiv","version":3}},"canonical_sha256":"8f6e7ffd86f81f594d626383a23871cd662543b76a9926abfc2c00e451f45697","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f6e7ffd86f81f594d626383a23871cd662543b76a9926abfc2c00e451f45697","first_computed_at":"2026-05-18T03:58:48.853322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:48.853322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xgm+Hq1kLvMS50bZVnKU3njLC0xXLSxtuFVRTr06tSYIaK3eaInpeFJagnHFNX688x0HqihsVqF2LqSbddJFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:48.854147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4230","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbcfd9315579ece0a77c60d8a17e59f40da8a991f315fa156e46b343f7b55f76","sha256:d9e93eb7275aceb98c6c71d968e452d785f33412cee280127f8e6b28629581c3"],"state_sha256":"f0d6ec442842446d3a9824dca854bcdf48186392b3d79213f24b1cdd05ddad75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKspLe4WSct3gpS0lVbU8a6MZiuHcv4j1h+pl5kR9RTDQcSiVYT1AkiSEbamQB3AGBX7mBzVOFLvEb1zlMizDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:34:12.341956Z","bundle_sha256":"e2b026ce8969300e954b31c872e6a85389bfac16648efca10e61bf2d362c4123"}}