{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TFWO7MIVR67JIL6YXZ5VJXUJZP","short_pith_number":"pith:TFWO7MIV","canonical_record":{"source":{"id":"1610.00373","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2016-10-03T00:05:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3d884c0cd44749bf233a7e214816c9adce1d2314bdbac72dfeaf224c8bb0b9f2","abstract_canon_sha256":"3cff6f32cb2ceb5ee6c7f85c880ed0b5ff02afc1514addcb5374a7834e9e340a"},"schema_version":"1.0"},"canonical_sha256":"996cefb1158fbe942fd8be7b54de89cbf1e3fff2d2e10d7a397065aa09ddf7d2","source":{"kind":"arxiv","id":"1610.00373","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00373","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00373v2","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00373","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"TFWO7MIVR67J","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TFWO7MIVR67JIL6Y","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TFWO7MIV","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TFWO7MIVR67JIL6YXZ5VJXUJZP","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00373","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2016-10-03T00:05:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3d884c0cd44749bf233a7e214816c9adce1d2314bdbac72dfeaf224c8bb0b9f2","abstract_canon_sha256":"3cff6f32cb2ceb5ee6c7f85c880ed0b5ff02afc1514addcb5374a7834e9e340a"},"schema_version":"1.0"},"canonical_sha256":"996cefb1158fbe942fd8be7b54de89cbf1e3fff2d2e10d7a397065aa09ddf7d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:21.948784Z","signature_b64":"1HgW692azlEcIiPG4TRZjrmet9SVDUOj7TxPr0+wNSwVuEwjGgno8lUO/f6eNIf977RGd6g9geKkN0lO00c8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"996cefb1158fbe942fd8be7b54de89cbf1e3fff2d2e10d7a397065aa09ddf7d2","last_reissued_at":"2026-05-18T01:02:21.947987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:21.947987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00373","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"np9vT/pQ1DBD1/7RchTHX0DFbMLd08eHidN7yDLR6cgWpoYhnEbkZ99P+D0iPb2MOFMMpNZHywQb0DM4hqM7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:34:11.454884Z"},"content_sha256":"1bb1968394d2b4e1d399b694083533345a71eec5016049fd864db056a7592290","schema_version":"1.0","event_id":"sha256:1bb1968394d2b4e1d399b694083533345a71eec5016049fd864db056a7592290"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TFWO7MIVR67JIL6YXZ5VJXUJZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Knapsack in Graph Groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.GR","authors_text":"Georg Zetzsche, Markus Lohrey","submitted_at":"2016-10-03T00:05:08Z","abstract_excerpt":"Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\\mathsf{NP}$. Here, we determine the exact complexity of the problem for every graph group. While the problem is $\\mathsf{TC}^0$-complete for complete graphs, it is $\\mathsf{LogCFL}$-complete for each (non-complete) transitive forest. For every remaining graph, the problem is $\\mathsf{NP}$-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00373","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7e2T5VheAdm+bTapOh6yYCIAi5uXR9ugfqHKmxuGvHpZA5qf/dEs/tE1kE96Z04kyfXAyBQOsUR+A6cHUuu0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:34:11.455337Z"},"content_sha256":"49cb4225c78379d2f90dddc139c385a73321930b596a6e156e0f5b7438393447","schema_version":"1.0","event_id":"sha256:49cb4225c78379d2f90dddc139c385a73321930b596a6e156e0f5b7438393447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP/bundle.json","state_url":"https://pith.science/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T01:34:11Z","links":{"resolver":"https://pith.science/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP","bundle":"https://pith.science/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP/bundle.json","state":"https://pith.science/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFWO7MIVR67JIL6YXZ5VJXUJZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TFWO7MIVR67JIL6YXZ5VJXUJZP","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":"3cff6f32cb2ceb5ee6c7f85c880ed0b5ff02afc1514addcb5374a7834e9e340a","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2016-10-03T00:05:08Z","title_canon_sha256":"3d884c0cd44749bf233a7e214816c9adce1d2314bdbac72dfeaf224c8bb0b9f2"},"schema_version":"1.0","source":{"id":"1610.00373","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00373","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00373v2","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00373","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"TFWO7MIVR67J","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TFWO7MIVR67JIL6Y","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TFWO7MIV","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:49cb4225c78379d2f90dddc139c385a73321930b596a6e156e0f5b7438393447","target":"graph","created_at":"2026-05-18T01:02:21Z","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":"Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\\mathsf{NP}$. Here, we determine the exact complexity of the problem for every graph group. While the problem is $\\mathsf{TC}^0$-complete for complete graphs, it is $\\mathsf{LogCFL}$-complete for each (non-complete) transitive forest. For every remaining graph, the problem is $\\mathsf{NP}$-complete.","authors_text":"Georg Zetzsche, Markus Lohrey","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2016-10-03T00:05:08Z","title":"The Complexity of Knapsack in Graph Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00373","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:1bb1968394d2b4e1d399b694083533345a71eec5016049fd864db056a7592290","target":"record","created_at":"2026-05-18T01:02:21Z","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":"3cff6f32cb2ceb5ee6c7f85c880ed0b5ff02afc1514addcb5374a7834e9e340a","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2016-10-03T00:05:08Z","title_canon_sha256":"3d884c0cd44749bf233a7e214816c9adce1d2314bdbac72dfeaf224c8bb0b9f2"},"schema_version":"1.0","source":{"id":"1610.00373","kind":"arxiv","version":2}},"canonical_sha256":"996cefb1158fbe942fd8be7b54de89cbf1e3fff2d2e10d7a397065aa09ddf7d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"996cefb1158fbe942fd8be7b54de89cbf1e3fff2d2e10d7a397065aa09ddf7d2","first_computed_at":"2026-05-18T01:02:21.947987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:21.947987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1HgW692azlEcIiPG4TRZjrmet9SVDUOj7TxPr0+wNSwVuEwjGgno8lUO/f6eNIf977RGd6g9geKkN0lO00c8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:21.948784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00373","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bb1968394d2b4e1d399b694083533345a71eec5016049fd864db056a7592290","sha256:49cb4225c78379d2f90dddc139c385a73321930b596a6e156e0f5b7438393447"],"state_sha256":"a6ff18443d4c057c389884fb287a0a9d5fc0bd699e55dd629e98f7b67f39d887"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfBR0xX/dlJ5DIww0ELWC5bAPU2cEY5KUL9XeI99Rqc/3e0ZwogrBCoPKlFnoW3YNMv1lRe5voe7LV28dWGtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:34:11.457960Z","bundle_sha256":"8c44c6ab017a37b69744e8e5b55734b862fc631b54fad3d14d5a1c05cb7ad109"}}