{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6TS4V5ZLDP5IE3JYAE3FBHP4TC","short_pith_number":"pith:6TS4V5ZL","schema_version":"1.0","canonical_sha256":"f4e5caf72b1bfa826d380136509dfc988fbeeb8fd936083a016bfb034eed0b6b","source":{"kind":"arxiv","id":"2511.03388","version":2},"attestation_state":"computed","paper":{"title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Rohit Narayanan","submitted_at":"2025-11-05T11:48:09Z","abstract_excerpt":"We introduce baggy elimination trees, a novel graph decomposition that generalises the classical elimination trees underlying treedepth, and use them to give a complete characterisation of the monotone bounded-depth formula complexity of graph homomorphism and coloured isomorphism polynomials. Specifically, we prove that the $\\Delta$-product depth monotone formula complexity of these polynomials is $\\Theta\\!\\left(n^{\\lambda_\\Delta(H)}\\right)$, where $\\lambda_\\Delta(H)$ is the minimum cost of a baggy elimination tree for $H$ at BET-depth~$\\Delta$.\n  This result closes the last open case in 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":"2511.03388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-11-05T11:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"c3e0f24e21afb1eb3ae84118674cbb0a03af67c3c8480656aa62d295d46afbe5","abstract_canon_sha256":"f6503d884985e44e40cbbdb730fbdb7f3ed2687aac0b2185813cfb0e8bc8ce63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:50.942923Z","signature_b64":"Gqi0ilSXw4RgftiEUo7uFyFIiNL7pj7GlHVkhxO6HXzzl1QB12b9BtwaXt8twNsbYko1Q+vSRKfKn/9NqITUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e5caf72b1bfa826d380136509dfc988fbeeb8fd936083a016bfb034eed0b6b","last_reissued_at":"2026-06-23T03:13:50.942443Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:50.942443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Rohit Narayanan","submitted_at":"2025-11-05T11:48:09Z","abstract_excerpt":"We introduce baggy elimination trees, a novel graph decomposition that generalises the classical elimination trees underlying treedepth, and use them to give a complete characterisation of the monotone bounded-depth formula complexity of graph homomorphism and coloured isomorphism polynomials. Specifically, we prove that the $\\Delta$-product depth monotone formula complexity of these polynomials is $\\Theta\\!\\left(n^{\\lambda_\\Delta(H)}\\right)$, where $\\lambda_\\Delta(H)$ is the minimum cost of a baggy elimination tree for $H$ at BET-depth~$\\Delta$.\n  This result closes the last open case in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.03388","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/2511.03388/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":"2511.03388","created_at":"2026-06-23T03:13:50.942492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.03388v2","created_at":"2026-06-23T03:13:50.942492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.03388","created_at":"2026-06-23T03:13:50.942492+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TS4V5ZLDP5I","created_at":"2026-06-23T03:13:50.942492+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TS4V5ZLDP5IE3JY","created_at":"2026-06-23T03:13:50.942492+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TS4V5ZL","created_at":"2026-06-23T03:13:50.942492+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/6TS4V5ZLDP5IE3JYAE3FBHP4TC","json":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC.json","graph_json":"https://pith.science/api/pith-number/6TS4V5ZLDP5IE3JYAE3FBHP4TC/graph.json","events_json":"https://pith.science/api/pith-number/6TS4V5ZLDP5IE3JYAE3FBHP4TC/events.json","paper":"https://pith.science/paper/6TS4V5ZL"},"agent_actions":{"view_html":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC","download_json":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC.json","view_paper":"https://pith.science/paper/6TS4V5ZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.03388&json=true","fetch_graph":"https://pith.science/api/pith-number/6TS4V5ZLDP5IE3JYAE3FBHP4TC/graph.json","fetch_events":"https://pith.science/api/pith-number/6TS4V5ZLDP5IE3JYAE3FBHP4TC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC/action/storage_attestation","attest_author":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC/action/author_attestation","sign_citation":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC/action/citation_signature","submit_replication":"https://pith.science/pith/6TS4V5ZLDP5IE3JYAE3FBHP4TC/action/replication_record"}},"created_at":"2026-06-23T03:13:50.942492+00:00","updated_at":"2026-06-23T03:13:50.942492+00:00"}