{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5GHKOJQNMTHWJ2KY6QAGH3J6PX","short_pith_number":"pith:5GHKOJQN","canonical_record":{"source":{"id":"1810.00980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-10-01T21:05:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4db19f177ea47d6164ae9207fbeb2d41620447a0c192f01e466c4f2b9a2f2c18","abstract_canon_sha256":"c61b38143b10f4402df71097bb9392c2c51afbaae42637d22a170952c6c781a0"},"schema_version":"1.0"},"canonical_sha256":"e98ea7260d64cf64e958f40063ed3e7dcc3207ee05a8672b5f980ec726258059","source":{"kind":"arxiv","id":"1810.00980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00980","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00980v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00980","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"5GHKOJQNMTHW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5GHKOJQNMTHWJ2KY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5GHKOJQN","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5GHKOJQNMTHWJ2KY6QAGH3J6PX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-10-01T21:05:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4db19f177ea47d6164ae9207fbeb2d41620447a0c192f01e466c4f2b9a2f2c18","abstract_canon_sha256":"c61b38143b10f4402df71097bb9392c2c51afbaae42637d22a170952c6c781a0"},"schema_version":"1.0"},"canonical_sha256":"e98ea7260d64cf64e958f40063ed3e7dcc3207ee05a8672b5f980ec726258059","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.365138Z","signature_b64":"MraKi7rceVNmq13mrPtyL/mQmTx8KbiYV8fXlczAPO+YSrc0qZfk/4QucqPlR/jB30l40hBLdleG7B6fC/NOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e98ea7260d64cf64e958f40063ed3e7dcc3207ee05a8672b5f980ec726258059","last_reissued_at":"2026-05-18T00:04:19.364430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.364430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00980","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-18T00:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9K76K5qeh5nZFI4ZiShac5PcUJtwjvnnB4GZKCmWYh+ZyiQTZoeVXCEsRaAlxtOXfRxtSM0X2Cf7+vQRg1NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:40:24.691549Z"},"content_sha256":"ffe54e8c96c9b6a738a070c0af3e106543bf315ca9f87fffb4408906330f9951","schema_version":"1.0","event_id":"sha256:ffe54e8c96c9b6a738a070c0af3e106543bf315ca9f87fffb4408906330f9951"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5GHKOJQNMTHWJ2KY6QAGH3J6PX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A sampling framework for counting temporal motifs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Austin Benson, Moses Charikar, Paul Liu","submitted_at":"2018-10-01T21:05:04Z","abstract_excerpt":"Pattern counting in graphs is fundamental to network science tasks, and there are many scalable methods for approximating counts of small patterns, often called motifs, in large graphs. However, modern graph datasets now contain richer structure, and incorporating temporal information in particular has become a critical part of network analysis. Temporal motifs, which are generalizations of small subgraph patterns that incorporate temporal ordering on edges, are an emerging part of the network analysis toolbox. However, there are no algorithms for fast estimation of temporal motifs counts; mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00980","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-18T00:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aroAVG1zW2N+RARvC2gRnx0eabnCjK4j9SigIHD9bNOFK2VNRH8VNIaMANFmMzbxHofxxpnVtORnyNDGYfXGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:40:24.691897Z"},"content_sha256":"23ca659d7ca9dfcd5624253e1db000aebd052c95d2363387fa768ca7e671dd91","schema_version":"1.0","event_id":"sha256:23ca659d7ca9dfcd5624253e1db000aebd052c95d2363387fa768ca7e671dd91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX/bundle.json","state_url":"https://pith.science/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX/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-22T04:40:24Z","links":{"resolver":"https://pith.science/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX","bundle":"https://pith.science/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX/bundle.json","state":"https://pith.science/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GHKOJQNMTHWJ2KY6QAGH3J6PX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5GHKOJQNMTHWJ2KY6QAGH3J6PX","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":"c61b38143b10f4402df71097bb9392c2c51afbaae42637d22a170952c6c781a0","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-10-01T21:05:04Z","title_canon_sha256":"4db19f177ea47d6164ae9207fbeb2d41620447a0c192f01e466c4f2b9a2f2c18"},"schema_version":"1.0","source":{"id":"1810.00980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00980","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00980v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00980","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"5GHKOJQNMTHW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5GHKOJQNMTHWJ2KY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5GHKOJQN","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:23ca659d7ca9dfcd5624253e1db000aebd052c95d2363387fa768ca7e671dd91","target":"graph","created_at":"2026-05-18T00:04:19Z","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":"Pattern counting in graphs is fundamental to network science tasks, and there are many scalable methods for approximating counts of small patterns, often called motifs, in large graphs. However, modern graph datasets now contain richer structure, and incorporating temporal information in particular has become a critical part of network analysis. Temporal motifs, which are generalizations of small subgraph patterns that incorporate temporal ordering on edges, are an emerging part of the network analysis toolbox. However, there are no algorithms for fast estimation of temporal motifs counts; mor","authors_text":"Austin Benson, Moses Charikar, Paul Liu","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-10-01T21:05:04Z","title":"A sampling framework for counting temporal motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00980","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:ffe54e8c96c9b6a738a070c0af3e106543bf315ca9f87fffb4408906330f9951","target":"record","created_at":"2026-05-18T00:04:19Z","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":"c61b38143b10f4402df71097bb9392c2c51afbaae42637d22a170952c6c781a0","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-10-01T21:05:04Z","title_canon_sha256":"4db19f177ea47d6164ae9207fbeb2d41620447a0c192f01e466c4f2b9a2f2c18"},"schema_version":"1.0","source":{"id":"1810.00980","kind":"arxiv","version":1}},"canonical_sha256":"e98ea7260d64cf64e958f40063ed3e7dcc3207ee05a8672b5f980ec726258059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e98ea7260d64cf64e958f40063ed3e7dcc3207ee05a8672b5f980ec726258059","first_computed_at":"2026-05-18T00:04:19.364430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:19.364430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MraKi7rceVNmq13mrPtyL/mQmTx8KbiYV8fXlczAPO+YSrc0qZfk/4QucqPlR/jB30l40hBLdleG7B6fC/NOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:19.365138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffe54e8c96c9b6a738a070c0af3e106543bf315ca9f87fffb4408906330f9951","sha256:23ca659d7ca9dfcd5624253e1db000aebd052c95d2363387fa768ca7e671dd91"],"state_sha256":"96f35be2efff2ee822c3b8ac8c5f7ae9563ea02c01ff98765b4891557da12db6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6FcrA2AtbklNDxGVQZGgGKekVdGDJRWDMhdTSwEAgaUKLoK1X+5ytbRl3kA6HyArDGWQbEQGiDZGAz0KNb7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:40:24.693879Z","bundle_sha256":"8a66cb5d4f62526f21d04c9972aa5d68a3fb2b64a4a530a6bcee95bbf2bc742f"}}