{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DSVOEBTU4V7AWAWGZFZDC4FEVN","short_pith_number":"pith:DSVOEBTU","schema_version":"1.0","canonical_sha256":"1caae20674e57e0b02c6c9723170a4ab717031db4aae1ebc773e49aafc1c5084","source":{"kind":"arxiv","id":"2404.04369","version":1},"attestation_state":"computed","paper":{"title":"A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Egor Gorbachev, Karl Bringmann","submitted_at":"2024-04-05T19:31:11Z","abstract_excerpt":"In an $m$-edge host graph $G$, all triangles can be listed in time $O(m^{1.5})$ [Itai, Rodeh '78], and all $k$-cycles can be listed in time $O(m^{2-1/{\\lceil k/2 \\rceil}} + t)$ where $t$ is the output size [Alon, Yuster, Zwick '97]. These classic results also hold for the colored problem variant, where the nodes of the host graph $G$ are colored by nodes in the pattern graph $H$, and we are only interested in subgraphs of $G$ that are isomorphic to the pattern $H$ and respect the colors. We study the problem of listing all $H$-subgraphs in the colored setting, for fixed pattern graphs $H$.\n  A"},"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":"2404.04369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-04-05T19:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"193f7a6a134d787b1ff2f9615739ab6b137b1aa76163bdc45338f85e930d0ba6","abstract_canon_sha256":"88e14f3aae5af81d7fbc79be15f259963d9426c83e3141a1312c2d57661fd10c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:15.644590Z","signature_b64":"2fZuELHpHuV9FMwgBR5QMCgDWiGhCzV6BQcShkdnnoIqklU6xjlpG+XTSb+0uT/08nFNNCtuDLhltShmttNUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1caae20674e57e0b02c6c9723170a4ab717031db4aae1ebc773e49aafc1c5084","last_reissued_at":"2026-07-05T08:05:15.644088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:15.644088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Egor Gorbachev, Karl Bringmann","submitted_at":"2024-04-05T19:31:11Z","abstract_excerpt":"In an $m$-edge host graph $G$, all triangles can be listed in time $O(m^{1.5})$ [Itai, Rodeh '78], and all $k$-cycles can be listed in time $O(m^{2-1/{\\lceil k/2 \\rceil}} + t)$ where $t$ is the output size [Alon, Yuster, Zwick '97]. These classic results also hold for the colored problem variant, where the nodes of the host graph $G$ are colored by nodes in the pattern graph $H$, and we are only interested in subgraphs of $G$ that are isomorphic to the pattern $H$ and respect the colors. We study the problem of listing all $H$-subgraphs in the colored setting, for fixed pattern graphs $H$.\n  A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04369","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/2404.04369/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":"2404.04369","created_at":"2026-07-05T08:05:15.644162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.04369v1","created_at":"2026-07-05T08:05:15.644162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04369","created_at":"2026-07-05T08:05:15.644162+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSVOEBTU4V7A","created_at":"2026-07-05T08:05:15.644162+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSVOEBTU4V7AWAWG","created_at":"2026-07-05T08:05:15.644162+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSVOEBTU","created_at":"2026-07-05T08:05:15.644162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.10217","citing_title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN","json":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN.json","graph_json":"https://pith.science/api/pith-number/DSVOEBTU4V7AWAWGZFZDC4FEVN/graph.json","events_json":"https://pith.science/api/pith-number/DSVOEBTU4V7AWAWGZFZDC4FEVN/events.json","paper":"https://pith.science/paper/DSVOEBTU"},"agent_actions":{"view_html":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN","download_json":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN.json","view_paper":"https://pith.science/paper/DSVOEBTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.04369&json=true","fetch_graph":"https://pith.science/api/pith-number/DSVOEBTU4V7AWAWGZFZDC4FEVN/graph.json","fetch_events":"https://pith.science/api/pith-number/DSVOEBTU4V7AWAWGZFZDC4FEVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN/action/storage_attestation","attest_author":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN/action/author_attestation","sign_citation":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN/action/citation_signature","submit_replication":"https://pith.science/pith/DSVOEBTU4V7AWAWGZFZDC4FEVN/action/replication_record"}},"created_at":"2026-07-05T08:05:15.644162+00:00","updated_at":"2026-07-05T08:05:15.644162+00:00"}