{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S22PUGSBRHCTP7IN6V43P4NVSP","short_pith_number":"pith:S22PUGSB","schema_version":"1.0","canonical_sha256":"96b4fa1a4189c537fd0df579b7f1b593e7933df34ba616d34bf6ee58ccc83b9b","source":{"kind":"arxiv","id":"2607.07595","version":1},"attestation_state":"computed","paper":{"title":"Induced packing treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Amir Nikabadi, Pawe{\\l} Rz\\k{a}\\.zewski","submitted_at":"2026-07-08T16:13:54Z","abstract_excerpt":"In this paper, we introduce a framework that aims to unify classes defined by forbidden induced subgraphs or induced minors with classes defined by the existence of certain structured tree decompositions. Let $\\mathcal{H}$ be a fixed family of graphs. We define \\emph{induced-$\\mathcal{H}$-packing treewidth}, a tree-decomposition-based graph parameter that, for each bag, measures the maximum number of pairwise anticomplete induced copies of graphs from $\\mathcal{H}$ intersecting that bag. This notion generalizes some previously studied parameters: when $\\mathcal{H}=\\{P_1\\}$, it is equivalent to"},"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":"2607.07595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T16:13:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"fb7c5c16d217318e70e8b1da970bca0a33ac570480b612acd115e9a0ee5d72ce","abstract_canon_sha256":"35c6a9d38a4252671776e7077dfbb4dda8ceba594df181ca015f1368e5cb36b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:30.447997Z","signature_b64":"NbC3TRZw1t5Z5LtGRRqd1+H3c8QP1A4BPrn1ZqOGdQzQjyAEPHDQ0Y3+XQ2iAqVfaQHEtpPsWHpJg19ISdX+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b4fa1a4189c537fd0df579b7f1b593e7933df34ba616d34bf6ee58ccc83b9b","last_reissued_at":"2026-07-09T01:20:30.447600Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:30.447600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced packing treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Amir Nikabadi, Pawe{\\l} Rz\\k{a}\\.zewski","submitted_at":"2026-07-08T16:13:54Z","abstract_excerpt":"In this paper, we introduce a framework that aims to unify classes defined by forbidden induced subgraphs or induced minors with classes defined by the existence of certain structured tree decompositions. Let $\\mathcal{H}$ be a fixed family of graphs. We define \\emph{induced-$\\mathcal{H}$-packing treewidth}, a tree-decomposition-based graph parameter that, for each bag, measures the maximum number of pairwise anticomplete induced copies of graphs from $\\mathcal{H}$ intersecting that bag. This notion generalizes some previously studied parameters: when $\\mathcal{H}=\\{P_1\\}$, it is equivalent to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07595","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/2607.07595/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":"2607.07595","created_at":"2026-07-09T01:20:30.447649+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07595v1","created_at":"2026-07-09T01:20:30.447649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07595","created_at":"2026-07-09T01:20:30.447649+00:00"},{"alias_kind":"pith_short_12","alias_value":"S22PUGSBRHCT","created_at":"2026-07-09T01:20:30.447649+00:00"},{"alias_kind":"pith_short_16","alias_value":"S22PUGSBRHCTP7IN","created_at":"2026-07-09T01:20:30.447649+00:00"},{"alias_kind":"pith_short_8","alias_value":"S22PUGSB","created_at":"2026-07-09T01:20:30.447649+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/S22PUGSBRHCTP7IN6V43P4NVSP","json":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP.json","graph_json":"https://pith.science/api/pith-number/S22PUGSBRHCTP7IN6V43P4NVSP/graph.json","events_json":"https://pith.science/api/pith-number/S22PUGSBRHCTP7IN6V43P4NVSP/events.json","paper":"https://pith.science/paper/S22PUGSB"},"agent_actions":{"view_html":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP","download_json":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP.json","view_paper":"https://pith.science/paper/S22PUGSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07595&json=true","fetch_graph":"https://pith.science/api/pith-number/S22PUGSBRHCTP7IN6V43P4NVSP/graph.json","fetch_events":"https://pith.science/api/pith-number/S22PUGSBRHCTP7IN6V43P4NVSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP/action/storage_attestation","attest_author":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP/action/author_attestation","sign_citation":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP/action/citation_signature","submit_replication":"https://pith.science/pith/S22PUGSBRHCTP7IN6V43P4NVSP/action/replication_record"}},"created_at":"2026-07-09T01:20:30.447649+00:00","updated_at":"2026-07-09T01:20:30.447649+00:00"}