{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:26A26YV34HTGXD4ZBWYAVNIH3F","short_pith_number":"pith:26A26YV3","canonical_record":{"source":{"id":"1301.1517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-08T12:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"1e4a03e60b248b96f7761d2ee890036166534d852898c0cc2d0abaeaa1c3dc17","abstract_canon_sha256":"7760467ad34b3785b796ec2a603b6ede4a5e8272db913b3c423e6f2bc0fa208f"},"schema_version":"1.0"},"canonical_sha256":"d781af62bbe1e66b8f990db00ab507d97a1e17816e725e092a59e3c48f5f2041","source":{"kind":"arxiv","id":"1301.1517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1517","created_at":"2026-05-18T03:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1517v1","created_at":"2026-05-18T03:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1517","created_at":"2026-05-18T03:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"26A26YV34HTG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"26A26YV34HTGXD4Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"26A26YV3","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:26A26YV34HTGXD4ZBWYAVNIH3F","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-08T12:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"1e4a03e60b248b96f7761d2ee890036166534d852898c0cc2d0abaeaa1c3dc17","abstract_canon_sha256":"7760467ad34b3785b796ec2a603b6ede4a5e8272db913b3c423e6f2bc0fa208f"},"schema_version":"1.0"},"canonical_sha256":"d781af62bbe1e66b8f990db00ab507d97a1e17816e725e092a59e3c48f5f2041","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:57.262360Z","signature_b64":"hJbXtL82nZGSHweaZnWIueFjIuIvJae+JHOnoPbDZYp0RIlm00S6p4iqyV9/C1Mwjil9/kvl1jy4LQ8UC4utDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d781af62bbe1e66b8f990db00ab507d97a1e17816e725e092a59e3c48f5f2041","last_reissued_at":"2026-05-18T03:36:57.261749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:57.261749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1517","source_version":1,"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-18T03:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JztNM0GXz92z3Q57PWNMwhefBwSCJrcxRRMt69tHWH9gRR1v8nkTnvBDHrAZFP6TbRjCnlWZdf97uwjFf8MaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:25:53.467464Z"},"content_sha256":"a1c918f8dffce3e9aa4d2c2d0731deae999a23a66f56405a9267ed3061c2b690","schema_version":"1.0","event_id":"sha256:a1c918f8dffce3e9aa4d2c2d0731deae999a23a66f56405a9267ed3061c2b690"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:26A26YV34HTGXD4ZBWYAVNIH3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Magnus Wahlstr\\\"om","submitted_at":"2013-01-08T12:48:52Z","abstract_excerpt":"We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of specified elements. Our approach gives a simple FPT algorithm for the problem, matching the $O^*(2^{|K|})$ running time of the algorithm of Bj\\\"orklund et al. (SODA, 2012). Furthermore, our approach is open for treatment by classical algebraic tools (e.g., Gaussian elimination), and we show that it leads to a polynomial compression of the problem, i.e., a polynomial-time reduction of the $K$-Cycle problem into an algebraic problem with coding size $O(|K|^3)$. This is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1517","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":""},"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-18T03:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcVyQguYNiRTdyeaH6S3Pf7t54ciOKEbv5PypwK6q/g/2PCXHmacsfY38bpfplRhDPLUdldQjgYI8lBc/E5FAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:25:53.467825Z"},"content_sha256":"28858790b4096ac0e8502196bd77786d4247b0eb9e0afbde7dae3a54001a9b7b","schema_version":"1.0","event_id":"sha256:28858790b4096ac0e8502196bd77786d4247b0eb9e0afbde7dae3a54001a9b7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26A26YV34HTGXD4ZBWYAVNIH3F/bundle.json","state_url":"https://pith.science/pith/26A26YV34HTGXD4ZBWYAVNIH3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26A26YV34HTGXD4ZBWYAVNIH3F/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-19T16:25:53Z","links":{"resolver":"https://pith.science/pith/26A26YV34HTGXD4ZBWYAVNIH3F","bundle":"https://pith.science/pith/26A26YV34HTGXD4ZBWYAVNIH3F/bundle.json","state":"https://pith.science/pith/26A26YV34HTGXD4ZBWYAVNIH3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26A26YV34HTGXD4ZBWYAVNIH3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:26A26YV34HTGXD4ZBWYAVNIH3F","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":"7760467ad34b3785b796ec2a603b6ede4a5e8272db913b3c423e6f2bc0fa208f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-08T12:48:52Z","title_canon_sha256":"1e4a03e60b248b96f7761d2ee890036166534d852898c0cc2d0abaeaa1c3dc17"},"schema_version":"1.0","source":{"id":"1301.1517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1517","created_at":"2026-05-18T03:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1517v1","created_at":"2026-05-18T03:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1517","created_at":"2026-05-18T03:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"26A26YV34HTG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"26A26YV34HTGXD4Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"26A26YV3","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:28858790b4096ac0e8502196bd77786d4247b0eb9e0afbde7dae3a54001a9b7b","target":"graph","created_at":"2026-05-18T03:36:57Z","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":"We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of specified elements. Our approach gives a simple FPT algorithm for the problem, matching the $O^*(2^{|K|})$ running time of the algorithm of Bj\\\"orklund et al. (SODA, 2012). Furthermore, our approach is open for treatment by classical algebraic tools (e.g., Gaussian elimination), and we show that it leads to a polynomial compression of the problem, i.e., a polynomial-time reduction of the $K$-Cycle problem into an algebraic problem with coding size $O(|K|^3)$. This is","authors_text":"Magnus Wahlstr\\\"om","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-08T12:48:52Z","title":"Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1517","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:a1c918f8dffce3e9aa4d2c2d0731deae999a23a66f56405a9267ed3061c2b690","target":"record","created_at":"2026-05-18T03:36:57Z","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":"7760467ad34b3785b796ec2a603b6ede4a5e8272db913b3c423e6f2bc0fa208f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-08T12:48:52Z","title_canon_sha256":"1e4a03e60b248b96f7761d2ee890036166534d852898c0cc2d0abaeaa1c3dc17"},"schema_version":"1.0","source":{"id":"1301.1517","kind":"arxiv","version":1}},"canonical_sha256":"d781af62bbe1e66b8f990db00ab507d97a1e17816e725e092a59e3c48f5f2041","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d781af62bbe1e66b8f990db00ab507d97a1e17816e725e092a59e3c48f5f2041","first_computed_at":"2026-05-18T03:36:57.261749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:57.261749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hJbXtL82nZGSHweaZnWIueFjIuIvJae+JHOnoPbDZYp0RIlm00S6p4iqyV9/C1Mwjil9/kvl1jy4LQ8UC4utDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:57.262360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1c918f8dffce3e9aa4d2c2d0731deae999a23a66f56405a9267ed3061c2b690","sha256:28858790b4096ac0e8502196bd77786d4247b0eb9e0afbde7dae3a54001a9b7b"],"state_sha256":"2699db94979a73a17114b96d2408511b1a7c4723328cd31862d820a42fa5abdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwUrKVOvtUPaBvGFLOcRyvwr1DW+/JgUsjxnS+hTQOgx7O/tmVODzVDVhtLWS6RPaIGS498DAn3VNsfusCtLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:25:53.469836Z","bundle_sha256":"497c5dec3dbd21d4f5fddf57c9de9c9d904965f7fdd4310bde8b0d92f7fd01b5"}}