{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5CTR2TDGCJZ65OS4UFA4MAHOJI","short_pith_number":"pith:5CTR2TDG","schema_version":"1.0","canonical_sha256":"e8a71d4c661273eeba5ca141c600ee4a2fd6307125d7685393cf97f064ccaff7","source":{"kind":"arxiv","id":"2405.06767","version":2},"attestation_state":"computed","paper":{"title":"Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Diandre Sabale, Kyle Deeds, Moe Kayali","submitted_at":"2024-05-10T18:38:27Z","abstract_excerpt":"Graph workloads pose a particularly challenging problem for query optimizers. They typically feature large queries made up of entirely many-to-many joins with complex correlations. This puts significant stress on traditional cardinality estimation methods which generally see catastrophic errors when estimating the size of queries with only a handful of joins. To overcome this, we propose COLOR, a framework for subgraph cardinality estimation which applies insights from graph compression theory to produce a compact summary that captures the global topology of the data graph. Further, we identif"},"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":"2405.06767","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-05-10T18:38:27Z","cross_cats_sorted":[],"title_canon_sha256":"34e2f02b58e1baa2a7de1f7a8d9fb3815e04163773e8d16cfaaf29da1c886807","abstract_canon_sha256":"4a56e3383d4f4fcc16078ac338652f684f98b952a2da6aa4e980af727d379525"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:53.327497Z","signature_b64":"qWKSn1iMb1HxucvczLkLoODHjfm+RZEJp1f5rNmfP6qmqnuzFw7ZVo57P2iR9RcZt2/Bd7yXXkawzzpjFldlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a71d4c661273eeba5ca141c600ee4a2fd6307125d7685393cf97f064ccaff7","last_reissued_at":"2026-07-05T10:55:53.327055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:53.327055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Diandre Sabale, Kyle Deeds, Moe Kayali","submitted_at":"2024-05-10T18:38:27Z","abstract_excerpt":"Graph workloads pose a particularly challenging problem for query optimizers. They typically feature large queries made up of entirely many-to-many joins with complex correlations. This puts significant stress on traditional cardinality estimation methods which generally see catastrophic errors when estimating the size of queries with only a handful of joins. To overcome this, we propose COLOR, a framework for subgraph cardinality estimation which applies insights from graph compression theory to produce a compact summary that captures the global topology of the data graph. Further, we identif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.06767","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.06767/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":"2405.06767","created_at":"2026-07-05T10:55:53.327111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.06767v2","created_at":"2026-07-05T10:55:53.327111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.06767","created_at":"2026-07-05T10:55:53.327111+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CTR2TDGCJZ6","created_at":"2026-07-05T10:55:53.327111+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CTR2TDGCJZ65OS4","created_at":"2026-07-05T10:55:53.327111+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CTR2TDG","created_at":"2026-07-05T10:55:53.327111+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI","json":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI.json","graph_json":"https://pith.science/api/pith-number/5CTR2TDGCJZ65OS4UFA4MAHOJI/graph.json","events_json":"https://pith.science/api/pith-number/5CTR2TDGCJZ65OS4UFA4MAHOJI/events.json","paper":"https://pith.science/paper/5CTR2TDG"},"agent_actions":{"view_html":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI","download_json":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI.json","view_paper":"https://pith.science/paper/5CTR2TDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.06767&json=true","fetch_graph":"https://pith.science/api/pith-number/5CTR2TDGCJZ65OS4UFA4MAHOJI/graph.json","fetch_events":"https://pith.science/api/pith-number/5CTR2TDGCJZ65OS4UFA4MAHOJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI/action/storage_attestation","attest_author":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI/action/author_attestation","sign_citation":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI/action/citation_signature","submit_replication":"https://pith.science/pith/5CTR2TDGCJZ65OS4UFA4MAHOJI/action/replication_record"}},"created_at":"2026-07-05T10:55:53.327111+00:00","updated_at":"2026-07-05T10:55:53.327111+00:00"}