{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QUAIHEICG7KS5B7D57FYUVWCUX","short_pith_number":"pith:QUAIHEIC","schema_version":"1.0","canonical_sha256":"850083910237d52e87e3efcb8a56c2a5ff19e8b364dedb7df74ebffbac569c88","source":{"kind":"arxiv","id":"1908.02530","version":1},"attestation_state":"computed","paper":{"title":"A Constraint Model for the Tree Decomposition of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Benjamin Bumpus, James Trimble, Patrick Prosser","submitted_at":"2019-08-07T11:18:27Z","abstract_excerpt":"We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that decomposition. Via a sequence of decision problems, the model allows us to find the tree width of a graph whilst delivering a tree decomposition of that width, i.e. a witness."},"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":"1908.02530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-07T11:18:27Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"ee528744ef692626b18f6b35cd8c297dd58a1b1572cfba5b7c81e4d5a0249772","abstract_canon_sha256":"d51f87e96e0435bf519112b6fae971ce784953a7f003e867b6bc196d3dc0208b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:09.973876Z","signature_b64":"N+1GELSeFEd72bJnI+iJWsYyvW0E/j1aXlKTFV54gOxOZcyLomrjJipEzbqCyPzqJTgXLLuRlcqsk84sbOsEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850083910237d52e87e3efcb8a56c2a5ff19e8b364dedb7df74ebffbac569c88","last_reissued_at":"2026-07-04T23:52:09.973477Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:09.973477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constraint Model for the Tree Decomposition of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Benjamin Bumpus, James Trimble, Patrick Prosser","submitted_at":"2019-08-07T11:18:27Z","abstract_excerpt":"We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that decomposition. Via a sequence of decision problems, the model allows us to find the tree width of a graph whilst delivering a tree decomposition of that width, i.e. a witness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02530","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/1908.02530/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":"1908.02530","created_at":"2026-07-04T23:52:09.973538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02530v1","created_at":"2026-07-04T23:52:09.973538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02530","created_at":"2026-07-04T23:52:09.973538+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUAIHEICG7KS","created_at":"2026-07-04T23:52:09.973538+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUAIHEICG7KS5B7D","created_at":"2026-07-04T23:52:09.973538+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUAIHEIC","created_at":"2026-07-04T23:52:09.973538+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/QUAIHEICG7KS5B7D57FYUVWCUX","json":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX.json","graph_json":"https://pith.science/api/pith-number/QUAIHEICG7KS5B7D57FYUVWCUX/graph.json","events_json":"https://pith.science/api/pith-number/QUAIHEICG7KS5B7D57FYUVWCUX/events.json","paper":"https://pith.science/paper/QUAIHEIC"},"agent_actions":{"view_html":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX","download_json":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX.json","view_paper":"https://pith.science/paper/QUAIHEIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02530&json=true","fetch_graph":"https://pith.science/api/pith-number/QUAIHEICG7KS5B7D57FYUVWCUX/graph.json","fetch_events":"https://pith.science/api/pith-number/QUAIHEICG7KS5B7D57FYUVWCUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX/action/storage_attestation","attest_author":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX/action/author_attestation","sign_citation":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX/action/citation_signature","submit_replication":"https://pith.science/pith/QUAIHEICG7KS5B7D57FYUVWCUX/action/replication_record"}},"created_at":"2026-07-04T23:52:09.973538+00:00","updated_at":"2026-07-04T23:52:09.973538+00:00"}