{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HNPN2OPB2VSRUU7HNZ364YVDBB","short_pith_number":"pith:HNPN2OPB","canonical_record":{"source":{"id":"2211.12101","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2022-11-22T09:07:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c328e6a9b6fec26cfe17dcf5c812c5b9082ced31f0ad52463af22bb4372a51e4","abstract_canon_sha256":"8115cbe5ffa347283af3c258e445ff36afdd07d2ff62d665ee20c76d33b3f491"},"schema_version":"1.0"},"canonical_sha256":"3b5edd39e1d5651a53e76e77ee62a3084c53ca12899ce220b6b746d67223f830","source":{"kind":"arxiv","id":"2211.12101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12101","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12101v1","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12101","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"HNPN2OPB2VSR","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"pith_short_16","alias_value":"HNPN2OPB2VSRUU7H","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"pith_short_8","alias_value":"HNPN2OPB","created_at":"2026-07-05T05:18:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HNPN2OPB2VSRUU7HNZ364YVDBB","target":"record","payload":{"canonical_record":{"source":{"id":"2211.12101","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2022-11-22T09:07:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c328e6a9b6fec26cfe17dcf5c812c5b9082ced31f0ad52463af22bb4372a51e4","abstract_canon_sha256":"8115cbe5ffa347283af3c258e445ff36afdd07d2ff62d665ee20c76d33b3f491"},"schema_version":"1.0"},"canonical_sha256":"3b5edd39e1d5651a53e76e77ee62a3084c53ca12899ce220b6b746d67223f830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:13.171108Z","signature_b64":"b8olfloNexso/O2VKtXqiIU4RABBo6J8+2jac5zBV37LFN6HbQHydLGAg2x6cg9CYHURxQ6NUGdt7lL4pq+KAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b5edd39e1d5651a53e76e77ee62a3084c53ca12899ce220b6b746d67223f830","last_reissued_at":"2026-07-05T05:18:13.170643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:13.170643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.12101","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-07-05T05:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rf51qI7PFY3GSfJOW9cGE89FfHRlsIlDJWGyXHKOh26B6QYcuRsx3n2+eTpy5sVIVYndZ1NiiJG/qgoYo+niCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T07:41:06.256667Z"},"content_sha256":"2a24983079b4cd7d7a7a1c828fa21d8d7fd7bb946086b677b025f689bf66e708","schema_version":"1.0","event_id":"sha256:2a24983079b4cd7d7a7a1c828fa21d8d7fd7bb946086b677b025f689bf66e708"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HNPN2OPB2VSRUU7HNZ364YVDBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Jingjing Wang, Kian-Lee Tan, Wenjun Jiang, Yanhao Wang, Yuchen Li","submitted_at":"2022-11-22T09:07:10Z","abstract_excerpt":"A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of vertices and a series of timestamped and directed edges. Temporal motifs are generalized from subgraph patterns in static graphs which consider edge orderings and durations in addition to topologies. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. Moreover, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12101","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.12101/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMj0TVFc46sDEZTEjW8ep6i/+VV4u02/LKqLtCAkLeggF2JlH2yl7sLdV57tDCLnPAbiLfIjrN7vB1uG2kaqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T07:41:06.257208Z"},"content_sha256":"ec4ed4547615323e6666f3f26b03fae458e95262d1b2ce6fe357ee712329cda7","schema_version":"1.0","event_id":"sha256:ec4ed4547615323e6666f3f26b03fae458e95262d1b2ce6fe357ee712329cda7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNPN2OPB2VSRUU7HNZ364YVDBB/bundle.json","state_url":"https://pith.science/pith/HNPN2OPB2VSRUU7HNZ364YVDBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNPN2OPB2VSRUU7HNZ364YVDBB/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-08-18T07:41:06Z","links":{"resolver":"https://pith.science/pith/HNPN2OPB2VSRUU7HNZ364YVDBB","bundle":"https://pith.science/pith/HNPN2OPB2VSRUU7HNZ364YVDBB/bundle.json","state":"https://pith.science/pith/HNPN2OPB2VSRUU7HNZ364YVDBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNPN2OPB2VSRUU7HNZ364YVDBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HNPN2OPB2VSRUU7HNZ364YVDBB","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":"8115cbe5ffa347283af3c258e445ff36afdd07d2ff62d665ee20c76d33b3f491","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2022-11-22T09:07:10Z","title_canon_sha256":"c328e6a9b6fec26cfe17dcf5c812c5b9082ced31f0ad52463af22bb4372a51e4"},"schema_version":"1.0","source":{"id":"2211.12101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12101","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12101v1","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12101","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"HNPN2OPB2VSR","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"pith_short_16","alias_value":"HNPN2OPB2VSRUU7H","created_at":"2026-07-05T05:18:13Z"},{"alias_kind":"pith_short_8","alias_value":"HNPN2OPB","created_at":"2026-07-05T05:18:13Z"}],"graph_snapshots":[{"event_id":"sha256:ec4ed4547615323e6666f3f26b03fae458e95262d1b2ce6fe357ee712329cda7","target":"graph","created_at":"2026-07-05T05:18:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.12101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of vertices and a series of timestamped and directed edges. Temporal motifs are generalized from subgraph patterns in static graphs which consider edge orderings and durations in addition to topologies. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. Moreover, t","authors_text":"Jingjing Wang, Kian-Lee Tan, Wenjun Jiang, Yanhao Wang, Yuchen Li","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2022-11-22T09:07:10Z","title":"Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12101","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:2a24983079b4cd7d7a7a1c828fa21d8d7fd7bb946086b677b025f689bf66e708","target":"record","created_at":"2026-07-05T05:18:13Z","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":"8115cbe5ffa347283af3c258e445ff36afdd07d2ff62d665ee20c76d33b3f491","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2022-11-22T09:07:10Z","title_canon_sha256":"c328e6a9b6fec26cfe17dcf5c812c5b9082ced31f0ad52463af22bb4372a51e4"},"schema_version":"1.0","source":{"id":"2211.12101","kind":"arxiv","version":1}},"canonical_sha256":"3b5edd39e1d5651a53e76e77ee62a3084c53ca12899ce220b6b746d67223f830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b5edd39e1d5651a53e76e77ee62a3084c53ca12899ce220b6b746d67223f830","first_computed_at":"2026-07-05T05:18:13.170643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:13.170643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b8olfloNexso/O2VKtXqiIU4RABBo6J8+2jac5zBV37LFN6HbQHydLGAg2x6cg9CYHURxQ6NUGdt7lL4pq+KAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:13.171108Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.12101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a24983079b4cd7d7a7a1c828fa21d8d7fd7bb946086b677b025f689bf66e708","sha256:ec4ed4547615323e6666f3f26b03fae458e95262d1b2ce6fe357ee712329cda7"],"state_sha256":"fbb46a2fdb2e7817ba6b5c9fb70007a2ff6e18637a248481ed1aa9ba9c14bcb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KvL0G5ByK6BzbMc3GONGtcm/X2o5LJ/k0q4m413SpSrilZL4sTvCLiCcgHv3WSpPK4G4oUuCvguSP5mo1926Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T07:41:06.262516Z","bundle_sha256":"dd9eb186edbcc9a92d081856716e0bb6b248ac7c967145799f4643634f61efe1"}}