{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WMEMYJALADDO3FSOAK6MVJQ7QD","short_pith_number":"pith:WMEMYJAL","schema_version":"1.0","canonical_sha256":"b308cc240b00c6ed964e02bccaa61f80e7b9f4af14317539aa0d094c68d65066","source":{"kind":"arxiv","id":"1808.00691","version":3},"attestation_state":"computed","paper":{"title":"On Triangle Estimation using Tripartite Independent Set Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra","submitted_at":"2018-08-02T07:15:14Z","abstract_excerpt":"Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic queries when \\emph{the number of triangles on any edge in the graph is polylogarithmically bounded}. Our query oracle {\\em Tripartite Independent Set} (TIS) takes three disjoint sets of vertices $A$, $B$ and $C$ as inputs, and answers whether there exists a triangle having one endpoint in each of these three sets. Our query model generally belongs to the class "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.00691","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-02T07:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"1acb283ac6f577ad5cac96b59aab36dfc9dce97b385d4d89b09e3a26a8a15f1f","abstract_canon_sha256":"b8934d0df0ab6e2e6a40c3e32ba56cdcda7d6c6496c6fa9b1b54850e6f83b551"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:52.848435Z","signature_b64":"V8AxmuOwipOqUUwGAHCjCyvq+AP+Fe0JQCrPrVUe1VHCrapTC/QWjwa3usRwj0VXHslD9DP4aP0rHYGVRB89CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b308cc240b00c6ed964e02bccaa61f80e7b9f4af14317539aa0d094c68d65066","last_reissued_at":"2026-07-05T01:23:52.848071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:52.848071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Triangle Estimation using Tripartite Independent Set Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra","submitted_at":"2018-08-02T07:15:14Z","abstract_excerpt":"Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic queries when \\emph{the number of triangles on any edge in the graph is polylogarithmically bounded}. Our query oracle {\\em Tripartite Independent Set} (TIS) takes three disjoint sets of vertices $A$, $B$ and $C$ as inputs, and answers whether there exists a triangle having one endpoint in each of these three sets. Our query model generally belongs to the class "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00691","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1808.00691/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.00691","created_at":"2026-07-05T01:23:52.848132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00691v3","created_at":"2026-07-05T01:23:52.848132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00691","created_at":"2026-07-05T01:23:52.848132+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMEMYJALADDO","created_at":"2026-07-05T01:23:52.848132+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMEMYJALADDO3FSO","created_at":"2026-07-05T01:23:52.848132+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMEMYJAL","created_at":"2026-07-05T01:23:52.848132+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04196","citing_title":"Hyperedge Estimation using Polylogarithmic Subset Queries","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD","json":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD.json","graph_json":"https://pith.science/api/pith-number/WMEMYJALADDO3FSOAK6MVJQ7QD/graph.json","events_json":"https://pith.science/api/pith-number/WMEMYJALADDO3FSOAK6MVJQ7QD/events.json","paper":"https://pith.science/paper/WMEMYJAL"},"agent_actions":{"view_html":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD","download_json":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD.json","view_paper":"https://pith.science/paper/WMEMYJAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00691&json=true","fetch_graph":"https://pith.science/api/pith-number/WMEMYJALADDO3FSOAK6MVJQ7QD/graph.json","fetch_events":"https://pith.science/api/pith-number/WMEMYJALADDO3FSOAK6MVJQ7QD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD/action/storage_attestation","attest_author":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD/action/author_attestation","sign_citation":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD/action/citation_signature","submit_replication":"https://pith.science/pith/WMEMYJALADDO3FSOAK6MVJQ7QD/action/replication_record"}},"created_at":"2026-07-05T01:23:52.848132+00:00","updated_at":"2026-07-05T01:23:52.848132+00:00"}