{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HXSLVTSF6JZFAIVFFWFPPKEMDS","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":"451cf46b243b5f55903f725a52894e74837e9636c5c41ffcce8ea8cca39847ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T07:07:21Z","title_canon_sha256":"5b75d4bfe6d051aab82d3b8932804ed4ea5752086df297fe0383b29c9976098e"},"schema_version":"1.0","source":{"id":"1807.04942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04942","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04942v2","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04942","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"HXSLVTSF6JZF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXSLVTSF6JZFAIVF","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXSLVTSF","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:4bcd4ffc0551927a04b9bed8f9b329a595b2eb04c47cba55df8183043b644520","target":"graph","created_at":"2026-05-18T00:05:36Z","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"},"paper":{"abstract_excerpt":"The automaton constrained tree knapsack problem is a variant of the knapsack problem in which the items are associated with the vertices of the tree, and we can select a subset of items that is accepted by a top-down tree automaton. If the capacities or the profits of items are integers, the problem can be solved in pseudo-polynomial time using the dynamic programming algorithm. However, the natural implementation of this algorithm has a quadratic pseudo-polynomial factor in its complexity because of the max-plus convolution. In this study, we propose a new dynamic programming technique, calle","authors_text":"Ryoma Sin'ya, Soh Kumabe, Takanori Maehara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T07:07:21Z","title":"Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04942","kind":"arxiv","version":2},"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:4f402ae301c21c882fdb54a9bfc9d9a1a2aacb2059c3779cd29bd9ac080b3669","target":"record","created_at":"2026-05-18T00:05:36Z","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":"451cf46b243b5f55903f725a52894e74837e9636c5c41ffcce8ea8cca39847ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T07:07:21Z","title_canon_sha256":"5b75d4bfe6d051aab82d3b8932804ed4ea5752086df297fe0383b29c9976098e"},"schema_version":"1.0","source":{"id":"1807.04942","kind":"arxiv","version":2}},"canonical_sha256":"3de4bace45f2725022a52d8af7a88c1ca61f641b56f3e352e3953127780acea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3de4bace45f2725022a52d8af7a88c1ca61f641b56f3e352e3953127780acea3","first_computed_at":"2026-05-18T00:05:36.993439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:36.993439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yvqCb+vf1dzqSm+HBnDt4MVUUv5ZSlawbrMqtQp+qKiQQ/fGkMO/nsAsLQk4TAAeM84gPL6ALpDdaGVNCH9RBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:36.993928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f402ae301c21c882fdb54a9bfc9d9a1a2aacb2059c3779cd29bd9ac080b3669","sha256:4bcd4ffc0551927a04b9bed8f9b329a595b2eb04c47cba55df8183043b644520"],"state_sha256":"f29b7d587dd9b9aa3cb2d969498e25d568a897adbab72024e463f4e15432b7ab"}