{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VTZ5MJUJR23SZKTZ2Z4L6776SU","short_pith_number":"pith:VTZ5MJUJ","canonical_record":{"source":{"id":"2502.15379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-21T11:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"b29878eae38ad918352370cd25eeb92966281c940f5ea0916858940da3469f9a","abstract_canon_sha256":"079ed3f6d782a5522255b738c15988a9ece66d1cd8b01792797629dd1b080908"},"schema_version":"1.0"},"canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","source":{"kind":"arxiv","id":"2502.15379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.15379","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"2502.15379v1","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15379","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"VTZ5MJUJR23S","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"pith_short_16","alias_value":"VTZ5MJUJR23SZKTZ","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"pith_short_8","alias_value":"VTZ5MJUJ","created_at":"2026-07-05T10:18:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VTZ5MJUJR23SZKTZ2Z4L6776SU","target":"record","payload":{"canonical_record":{"source":{"id":"2502.15379","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-21T11:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"b29878eae38ad918352370cd25eeb92966281c940f5ea0916858940da3469f9a","abstract_canon_sha256":"079ed3f6d782a5522255b738c15988a9ece66d1cd8b01792797629dd1b080908"},"schema_version":"1.0"},"canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:00.919932Z","signature_b64":"BKVoS4IRbjTm3nAkRXWTRqInf25B+9IPAv7Ykk9sFF+4Y42dmrurJi/HR5NzAeLM4iJNg41T5QzKfwt7hoLQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","last_reissued_at":"2026-07-05T10:18:00.919495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:00.919495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.15379","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-05T10:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"og4sAl495S/qa8rSDWlWKSAeCxX2HAgvTpLaJky3H9t2h3ZVVlglgWua+iLxvstXVG0Kd+hznNyJa8v9cIqJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:17:37.052315Z"},"content_sha256":"c35dcb92eb00378768e150b6aaecd7142f33e5c0e2c65365b41d9a72198c5688","schema_version":"1.0","event_id":"sha256:c35dcb92eb00378768e150b6aaecd7142f33e5c0e2c65365b41d9a72198c5688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VTZ5MJUJR23SZKTZ2Z4L6776SU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arijit Bishnu, Debarshi Chanda, Gopinath Mishra","submitted_at":"2025-02-21T11:04:43Z","abstract_excerpt":"Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \\varepsilon, \\delta <1$, along with \\texttt{Degree}, \\texttt{Neighbour}, \\texttt{Edge} and \\texttt{RandomEdge} query access to $G$, we provide a query based randomized algorithm to generate an estimate $\\widehat{T}$ of the number of triangles $T$ in $G$, such that $\\widehat{T} \\in [(1-\\varepsilon)T , (1+\\varepsilon)T]$ with probability at least $1-\\delta$. The query complexity of our algorithm is $\\widetilde{O}\\left({m \\alpha \\log(1/\\delta)}/{\\varepsilon^3 T}\\right)$, where $\\alpha$ is the arbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15379","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/2502.15379/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-05T10:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWdNhDLfiwjGIYtUbq5tJQTIu/sBLS2TFbfY9h+h7t0X4jUurFY4NNliqUQzua16gMzlLW78YUtS9gYViVu/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:17:37.052818Z"},"content_sha256":"80c6b7cb58999746faaa21659558a1a9341ee17efaf1a4ca5ab4ff2c09bd7a3e","schema_version":"1.0","event_id":"sha256:80c6b7cb58999746faaa21659558a1a9341ee17efaf1a4ca5ab4ff2c09bd7a3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/bundle.json","state_url":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/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-10T16:17:37Z","links":{"resolver":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU","bundle":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/bundle.json","state":"https://pith.science/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTZ5MJUJR23SZKTZ2Z4L6776SU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VTZ5MJUJR23SZKTZ2Z4L6776SU","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":"079ed3f6d782a5522255b738c15988a9ece66d1cd8b01792797629dd1b080908","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-21T11:04:43Z","title_canon_sha256":"b29878eae38ad918352370cd25eeb92966281c940f5ea0916858940da3469f9a"},"schema_version":"1.0","source":{"id":"2502.15379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.15379","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"2502.15379v1","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15379","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"VTZ5MJUJR23S","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"pith_short_16","alias_value":"VTZ5MJUJR23SZKTZ","created_at":"2026-07-05T10:18:00Z"},{"alias_kind":"pith_short_8","alias_value":"VTZ5MJUJ","created_at":"2026-07-05T10:18:00Z"}],"graph_snapshots":[{"event_id":"sha256:80c6b7cb58999746faaa21659558a1a9341ee17efaf1a4ca5ab4ff2c09bd7a3e","target":"graph","created_at":"2026-07-05T10:18:00Z","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/2502.15379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \\varepsilon, \\delta <1$, along with \\texttt{Degree}, \\texttt{Neighbour}, \\texttt{Edge} and \\texttt{RandomEdge} query access to $G$, we provide a query based randomized algorithm to generate an estimate $\\widehat{T}$ of the number of triangles $T$ in $G$, such that $\\widehat{T} \\in [(1-\\varepsilon)T , (1+\\varepsilon)T]$ with probability at least $1-\\delta$. The query complexity of our algorithm is $\\widetilde{O}\\left({m \\alpha \\log(1/\\delta)}/{\\varepsilon^3 T}\\right)$, where $\\alpha$ is the arbo","authors_text":"Arijit Bishnu, Debarshi Chanda, Gopinath Mishra","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-21T11:04:43Z","title":"Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15379","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:c35dcb92eb00378768e150b6aaecd7142f33e5c0e2c65365b41d9a72198c5688","target":"record","created_at":"2026-07-05T10:18:00Z","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":"079ed3f6d782a5522255b738c15988a9ece66d1cd8b01792797629dd1b080908","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-21T11:04:43Z","title_canon_sha256":"b29878eae38ad918352370cd25eeb92966281c940f5ea0916858940da3469f9a"},"schema_version":"1.0","source":{"id":"2502.15379","kind":"arxiv","version":1}},"canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acf3d626898eb72caa79d678bf7ffe9539b877dfdb060c83a0e1dbc53a133e3d","first_computed_at":"2026-07-05T10:18:00.919495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:18:00.919495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BKVoS4IRbjTm3nAkRXWTRqInf25B+9IPAv7Ykk9sFF+4Y42dmrurJi/HR5NzAeLM4iJNg41T5QzKfwt7hoLQDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:18:00.919932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.15379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c35dcb92eb00378768e150b6aaecd7142f33e5c0e2c65365b41d9a72198c5688","sha256:80c6b7cb58999746faaa21659558a1a9341ee17efaf1a4ca5ab4ff2c09bd7a3e"],"state_sha256":"2cf25f812fc08b0a97926469533025ffc038bbd75e06150432e1399a66ac038c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1BeDEpgJ9x5hm4wu0hy49gChnC9tADg2B9rCZ70yew+FGbj/EAMEcxYBueQg477mokPMohm9wdMlfMO/xPRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:17:37.057264Z","bundle_sha256":"6b5a1143fdadb332096254c475b3441178ec85d4c16dd68baae3c7912f5534ef"}}