{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OYP72VSZLOIOK3NDTOFHHFO2MR","short_pith_number":"pith:OYP72VSZ","schema_version":"1.0","canonical_sha256":"761ffd56595b90e56da39b8a7395da644c83982333e25cd2fa5ee02d2d9f8d18","source":{"kind":"arxiv","id":"2505.22894","version":1},"attestation_state":"computed","paper":{"title":"Monotone Bounded-Depth Complexity of Homomorphism Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"C. S. Bhargav, Prateek Dwivedi, Radu Curticapean, Shiteng Chen","submitted_at":"2025-05-28T21:56:54Z","abstract_excerpt":"For every fixed graph $H$, it is known that homomorphism counts from $H$ and colorful $H$-subgraph counts can be determined in $O(n^{t+1})$ time on $n$-vertex input graphs $G$, where $t$ is the treewidth of $H$. On the other hand, a running time of $n^{o(t / \\log t)}$ would refute the exponential-time hypothesis. Komarath, Pandey and Rahul (Algorithmica, 2023) studied algebraic variants of these counting problems, i.e., homomorphism and subgraph $\\textit{polynomials}$ for fixed graphs $H$. These polynomials are weighted sums over the objects counted above, where each object is weighted by the "},"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":"2505.22894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T21:56:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"18ba800d58a5382ce6b8ccae2fa6528a8011f7ef5e37e4f03381bc3bf20aae35","abstract_canon_sha256":"1a11488f4944c29dbe68a3b91910892fa9a4cc5793d8920a0e84297fe6e76b09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:51.559526Z","signature_b64":"AxM7EqKtIK38+Ky3uVV1c/W3finNh52QULeYZ3p4/A3qfqtVrZihXsdIjBm64D0rHTokRFbL9m7c9M4w6WuwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"761ffd56595b90e56da39b8a7395da644c83982333e25cd2fa5ee02d2d9f8d18","last_reissued_at":"2026-07-05T11:11:51.559015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:51.559015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Bounded-Depth Complexity of Homomorphism Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"C. S. Bhargav, Prateek Dwivedi, Radu Curticapean, Shiteng Chen","submitted_at":"2025-05-28T21:56:54Z","abstract_excerpt":"For every fixed graph $H$, it is known that homomorphism counts from $H$ and colorful $H$-subgraph counts can be determined in $O(n^{t+1})$ time on $n$-vertex input graphs $G$, where $t$ is the treewidth of $H$. On the other hand, a running time of $n^{o(t / \\log t)}$ would refute the exponential-time hypothesis. Komarath, Pandey and Rahul (Algorithmica, 2023) studied algebraic variants of these counting problems, i.e., homomorphism and subgraph $\\textit{polynomials}$ for fixed graphs $H$. These polynomials are weighted sums over the objects counted above, where each object is weighted by the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22894","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/2505.22894/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":"2505.22894","created_at":"2026-07-05T11:11:51.559086+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22894v1","created_at":"2026-07-05T11:11:51.559086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22894","created_at":"2026-07-05T11:11:51.559086+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYP72VSZLOIO","created_at":"2026-07-05T11:11:51.559086+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYP72VSZLOIOK3ND","created_at":"2026-07-05T11:11:51.559086+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYP72VSZ","created_at":"2026-07-05T11:11:51.559086+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/OYP72VSZLOIOK3NDTOFHHFO2MR","json":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR.json","graph_json":"https://pith.science/api/pith-number/OYP72VSZLOIOK3NDTOFHHFO2MR/graph.json","events_json":"https://pith.science/api/pith-number/OYP72VSZLOIOK3NDTOFHHFO2MR/events.json","paper":"https://pith.science/paper/OYP72VSZ"},"agent_actions":{"view_html":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR","download_json":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR.json","view_paper":"https://pith.science/paper/OYP72VSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22894&json=true","fetch_graph":"https://pith.science/api/pith-number/OYP72VSZLOIOK3NDTOFHHFO2MR/graph.json","fetch_events":"https://pith.science/api/pith-number/OYP72VSZLOIOK3NDTOFHHFO2MR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/action/storage_attestation","attest_author":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/action/author_attestation","sign_citation":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/action/citation_signature","submit_replication":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/action/replication_record"}},"created_at":"2026-07-05T11:11:51.559086+00:00","updated_at":"2026-07-05T11:11:51.559086+00:00"}