{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S22PUGSBRHCTP7IN6V43P4NVSP","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"35c6a9d38a4252671776e7077dfbb4dda8ceba594df181ca015f1368e5cb36b4","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T16:13:54Z","title_canon_sha256":"fb7c5c16d217318e70e8b1da970bca0a33ac570480b612acd115e9a0ee5d72ce"},"schema_version":"1.0","source":{"id":"2607.07595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07595","created_at":"2026-07-09T01:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07595v1","created_at":"2026-07-09T01:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07595","created_at":"2026-07-09T01:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"S22PUGSBRHCT","created_at":"2026-07-09T01:20:30Z"},{"alias_kind":"pith_short_16","alias_value":"S22PUGSBRHCTP7IN","created_at":"2026-07-09T01:20:30Z"},{"alias_kind":"pith_short_8","alias_value":"S22PUGSB","created_at":"2026-07-09T01:20:30Z"}],"graph_snapshots":[{"event_id":"sha256:8a12a96b6ae00abaa9fabd6414daf1d9e61e1095b58c16e985369d0ed7cad4cd","target":"graph","created_at":"2026-07-09T01:20:30Z","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/2607.07595/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amir Nikabadi, Pawe{\\l} Rz\\k{a}\\.zewski","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T16:13:54Z","title":"Induced packing treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07595","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:fbc54eec28d8bab558fd4ac38fcf32cbbd829db202da98ecede9a5410b169c31","target":"record","created_at":"2026-07-09T01:20:30Z","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":"35c6a9d38a4252671776e7077dfbb4dda8ceba594df181ca015f1368e5cb36b4","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T16:13:54Z","title_canon_sha256":"fb7c5c16d217318e70e8b1da970bca0a33ac570480b612acd115e9a0ee5d72ce"},"schema_version":"1.0","source":{"id":"2607.07595","kind":"arxiv","version":1}},"canonical_sha256":"96b4fa1a4189c537fd0df579b7f1b593e7933df34ba616d34bf6ee58ccc83b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b4fa1a4189c537fd0df579b7f1b593e7933df34ba616d34bf6ee58ccc83b9b","first_computed_at":"2026-07-09T01:20:30.447600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:30.447600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NbC3TRZw1t5Z5LtGRRqd1+H3c8QP1A4BPrn1ZqOGdQzQjyAEPHDQ0Y3+XQ2iAqVfaQHEtpPsWHpJg19ISdX+AQ==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:30.447997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07595","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:96bb7ff557ff97e5a10ec01fb6209b8e28ed105a0521413fc0ce4f74cea791d6","sha256:e93107f0644b1bc6cd60c41b2d96b34bb300d530482855cdc14f2e87c47dbb16","sha256:f28aef3957d0a23ef311ab7addd9fc7f55fdf8adbc896fe5adb06dff73b3c5ef"]}],"invalid_events":[],"applied_event_ids":["sha256:fbc54eec28d8bab558fd4ac38fcf32cbbd829db202da98ecede9a5410b169c31","sha256:8a12a96b6ae00abaa9fabd6414daf1d9e61e1095b58c16e985369d0ed7cad4cd"],"state_sha256":"10aefc7eac7af6166c04842c3a943b2e1badedee4b0269c89519d57d419ae7bf"}