{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OYP72VSZLOIOK3NDTOFHHFO2MR","short_pith_number":"pith:OYP72VSZ","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"},"canonical_sha256":"761ffd56595b90e56da39b8a7395da644c83982333e25cd2fa5ee02d2d9f8d18","source":{"kind":"arxiv","id":"2505.22894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22894","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22894v1","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22894","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"OYP72VSZLOIO","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"pith_short_16","alias_value":"OYP72VSZLOIOK3ND","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"pith_short_8","alias_value":"OYP72VSZ","created_at":"2026-07-05T11:11:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OYP72VSZLOIOK3NDTOFHHFO2MR","target":"record","payload":{"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"},"canonical_sha256":"761ffd56595b90e56da39b8a7395da644c83982333e25cd2fa5ee02d2d9f8d18","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"},"source_kind":"arxiv","source_id":"2505.22894","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-05T11:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsKOn9z0FbHf4JxVLs2Rm/Ho9cqUOEFB38uK3yNQsIdbGHnA6jm68v9dGkAh07tH61E36F5TDhn2GHX6c71VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:32:29.589112Z"},"content_sha256":"bd7ee7c5ca94d3668d25e2ca56e7cc13f5c3ab28cb49a8a12cada56faa6adc4d","schema_version":"1.0","event_id":"sha256:bd7ee7c5ca94d3668d25e2ca56e7cc13f5c3ab28cb49a8a12cada56faa6adc4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OYP72VSZLOIOK3NDTOFHHFO2MR","target":"graph","payload":{"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"},"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-05T11:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4sIGKpumd+4cqiXx+wJ4lKGO4eaQ7b6rCBfJgcC3iG7uQiqWiWfVZ8bW90clL70N60W0PQ0pDkZjM2BR9CDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T11:32:29.590010Z"},"content_sha256":"4e77f223dd8ef3bd8e98171e9cd475988bed1adb6315be88a33453be03e0be4a","schema_version":"1.0","event_id":"sha256:4e77f223dd8ef3bd8e98171e9cd475988bed1adb6315be88a33453be03e0be4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/bundle.json","state_url":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/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-07T11:32:29Z","links":{"resolver":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR","bundle":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/bundle.json","state":"https://pith.science/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYP72VSZLOIOK3NDTOFHHFO2MR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OYP72VSZLOIOK3NDTOFHHFO2MR","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":"1a11488f4944c29dbe68a3b91910892fa9a4cc5793d8920a0e84297fe6e76b09","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T21:56:54Z","title_canon_sha256":"18ba800d58a5382ce6b8ccae2fa6528a8011f7ef5e37e4f03381bc3bf20aae35"},"schema_version":"1.0","source":{"id":"2505.22894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22894","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22894v1","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22894","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"OYP72VSZLOIO","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"pith_short_16","alias_value":"OYP72VSZLOIOK3ND","created_at":"2026-07-05T11:11:51Z"},{"alias_kind":"pith_short_8","alias_value":"OYP72VSZ","created_at":"2026-07-05T11:11:51Z"}],"graph_snapshots":[{"event_id":"sha256:4e77f223dd8ef3bd8e98171e9cd475988bed1adb6315be88a33453be03e0be4a","target":"graph","created_at":"2026-07-05T11:11:51Z","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/2505.22894/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"C. S. Bhargav, Prateek Dwivedi, Radu Curticapean, Shiteng Chen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T21:56:54Z","title":"Monotone Bounded-Depth Complexity of Homomorphism Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22894","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:bd7ee7c5ca94d3668d25e2ca56e7cc13f5c3ab28cb49a8a12cada56faa6adc4d","target":"record","created_at":"2026-07-05T11:11:51Z","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":"1a11488f4944c29dbe68a3b91910892fa9a4cc5793d8920a0e84297fe6e76b09","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T21:56:54Z","title_canon_sha256":"18ba800d58a5382ce6b8ccae2fa6528a8011f7ef5e37e4f03381bc3bf20aae35"},"schema_version":"1.0","source":{"id":"2505.22894","kind":"arxiv","version":1}},"canonical_sha256":"761ffd56595b90e56da39b8a7395da644c83982333e25cd2fa5ee02d2d9f8d18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"761ffd56595b90e56da39b8a7395da644c83982333e25cd2fa5ee02d2d9f8d18","first_computed_at":"2026-07-05T11:11:51.559015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:51.559015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AxM7EqKtIK38+Ky3uVV1c/W3finNh52QULeYZ3p4/A3qfqtVrZihXsdIjBm64D0rHTokRFbL9m7c9M4w6WuwDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:51.559526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.22894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd7ee7c5ca94d3668d25e2ca56e7cc13f5c3ab28cb49a8a12cada56faa6adc4d","sha256:4e77f223dd8ef3bd8e98171e9cd475988bed1adb6315be88a33453be03e0be4a"],"state_sha256":"d00b3477c97904c9973c23659817d954236d07e47a82f36ddf40b05b66ec4e62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AQm4kVMKukjdtZf8FVIP8+2cRTCSJWklfU/hQGKuMNgpVtP2CI51ZElvDfmXa2pK48qIuuhXnOqhXoCx6kzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T11:32:29.603673Z","bundle_sha256":"e2c09a146d704f6b72f71c232e23bf9e31ad3691ca008e177a6f53fae6b5ba83"}}