{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6W6L7NXQPSAGDUQ4M2GTFBTYOW","short_pith_number":"pith:6W6L7NXQ","canonical_record":{"source":{"id":"1705.10195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:05:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8fe46e0209961f8f45eb9d48008b89ff0620f9edc8339ebac859ee9254259e3f","abstract_canon_sha256":"f2d5495c65072fc13a887c8b70d3a8d352e2062f50a8317742a49a998aa7a312"},"schema_version":"1.0"},"canonical_sha256":"f5bcbfb6f07c8061d21c668d32867875af339e7879934dfe6a60f39892020ad2","source":{"kind":"arxiv","id":"1705.10195","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10195","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10195v2","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10195","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"6W6L7NXQPSAG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6W6L7NXQPSAGDUQ4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6W6L7NXQ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6W6L7NXQPSAGDUQ4M2GTFBTYOW","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:05:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8fe46e0209961f8f45eb9d48008b89ff0620f9edc8339ebac859ee9254259e3f","abstract_canon_sha256":"f2d5495c65072fc13a887c8b70d3a8d352e2062f50a8317742a49a998aa7a312"},"schema_version":"1.0"},"canonical_sha256":"f5bcbfb6f07c8061d21c668d32867875af339e7879934dfe6a60f39892020ad2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:37.114173Z","signature_b64":"8C7IXuZ0Q5kklWbPDQfj8eVlc1BNqATv19VXgXIP4L5kUdbCAWQjLbSwNwkeNL7sOt1Eu8s9oOpeFvMWrBDrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bcbfb6f07c8061d21c668d32867875af339e7879934dfe6a60f39892020ad2","last_reissued_at":"2026-05-18T00:34:37.113652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:37.113652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10195","source_version":2,"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-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2gvsxkGnA4IjwiHj2sz0/g3jMh/16m9o/Y3bq6Kik7pC5uOEJdVnpr0tiGA0bDKeqiTsq5rgtxbftfem/DuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:21:46.669475Z"},"content_sha256":"dbb32be979f7378da82b5e8a4d39bfee1cf16da0ec749b84067be022b8828a72","schema_version":"1.0","event_id":"sha256:dbb32be979f7378da82b5e8a4d39bfee1cf16da0ec749b84067be022b8828a72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6W6L7NXQPSAGDUQ4M2GTFBTYOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic subgraph detection in broadcast CONGEST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Janne H. Korhonen, Joel Rybicki","submitted_at":"2017-05-29T14:05:45Z","abstract_excerpt":"We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation:\n  -- For any constant $k$, detecting $k$-paths and trees on $k$ nodes can be done in $O(1)$ rounds.\n  -- For any constant $k$, detecting $k$-cycles and pseudotrees on $k$ nodes can be done in $O(n)$ rounds.\n  -- On $d$-degenerate graphs, cliques and $4$-cycles can be enumerated in $O(d + \\log n)$ rounds, and $5$-cycles in $O(d^2 + \\log n)$ rounds.\n  In many cases, these bounds are tight up to logarithmic factors. Moreover, we show that the algorithms for $d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10195","kind":"arxiv","version":2},"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-18T00:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vEuL+h7cV/YLViz2UHzzGT05SCOABza737s/qun69FsyhxFy83NNanJhX3xPa9i6JMNwwCC5BxmWqUNGOxyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:21:46.669821Z"},"content_sha256":"16561ab3e4cd7b1b60bcf8e69a97a3682c2199302008c76f9ce33946d1ee3f7e","schema_version":"1.0","event_id":"sha256:16561ab3e4cd7b1b60bcf8e69a97a3682c2199302008c76f9ce33946d1ee3f7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW/bundle.json","state_url":"https://pith.science/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW/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-08T10:21:46Z","links":{"resolver":"https://pith.science/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW","bundle":"https://pith.science/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW/bundle.json","state":"https://pith.science/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W6L7NXQPSAGDUQ4M2GTFBTYOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6W6L7NXQPSAGDUQ4M2GTFBTYOW","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":"f2d5495c65072fc13a887c8b70d3a8d352e2062f50a8317742a49a998aa7a312","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:05:45Z","title_canon_sha256":"8fe46e0209961f8f45eb9d48008b89ff0620f9edc8339ebac859ee9254259e3f"},"schema_version":"1.0","source":{"id":"1705.10195","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10195","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10195v2","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10195","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"6W6L7NXQPSAG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6W6L7NXQPSAGDUQ4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6W6L7NXQ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:16561ab3e4cd7b1b60bcf8e69a97a3682c2199302008c76f9ce33946d1ee3f7e","target":"graph","created_at":"2026-05-18T00:34:37Z","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 simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation:\n  -- For any constant $k$, detecting $k$-paths and trees on $k$ nodes can be done in $O(1)$ rounds.\n  -- For any constant $k$, detecting $k$-cycles and pseudotrees on $k$ nodes can be done in $O(n)$ rounds.\n  -- On $d$-degenerate graphs, cliques and $4$-cycles can be enumerated in $O(d + \\log n)$ rounds, and $5$-cycles in $O(d^2 + \\log n)$ rounds.\n  In many cases, these bounds are tight up to logarithmic factors. Moreover, we show that the algorithms for $d","authors_text":"Janne H. Korhonen, Joel Rybicki","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:05:45Z","title":"Deterministic subgraph detection in broadcast CONGEST"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10195","kind":"arxiv","version":2},"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:dbb32be979f7378da82b5e8a4d39bfee1cf16da0ec749b84067be022b8828a72","target":"record","created_at":"2026-05-18T00:34:37Z","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":"f2d5495c65072fc13a887c8b70d3a8d352e2062f50a8317742a49a998aa7a312","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T14:05:45Z","title_canon_sha256":"8fe46e0209961f8f45eb9d48008b89ff0620f9edc8339ebac859ee9254259e3f"},"schema_version":"1.0","source":{"id":"1705.10195","kind":"arxiv","version":2}},"canonical_sha256":"f5bcbfb6f07c8061d21c668d32867875af339e7879934dfe6a60f39892020ad2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5bcbfb6f07c8061d21c668d32867875af339e7879934dfe6a60f39892020ad2","first_computed_at":"2026-05-18T00:34:37.113652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:37.113652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8C7IXuZ0Q5kklWbPDQfj8eVlc1BNqATv19VXgXIP4L5kUdbCAWQjLbSwNwkeNL7sOt1Eu8s9oOpeFvMWrBDrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:37.114173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10195","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbb32be979f7378da82b5e8a4d39bfee1cf16da0ec749b84067be022b8828a72","sha256:16561ab3e4cd7b1b60bcf8e69a97a3682c2199302008c76f9ce33946d1ee3f7e"],"state_sha256":"bbda893b74b5d044e1d86f46c3c185562c546d664fc54d80332478d3352265ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ljf0I6blcxm7YgyXbzAwQ4y0u9l/KQ6m7M4x967/Gzo7Br9CFYb+YGyuADaZu/Opshw3rolUfrPe0+WvlqRrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:21:46.671871Z","bundle_sha256":"147eb2ab56f63c620980c437e8840d9affdda76366b179704b0d01f8bf64c35e"}}