{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2765K6WQO4X45IJBJNDIUTRUQW","short_pith_number":"pith:2765K6WQ","canonical_record":{"source":{"id":"1310.0919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-10-03T08:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"9b508ab11bead8ac32595d95a6375b6476e9bbdb5428c0bc6d0e8aba3be0bb02","abstract_canon_sha256":"b806db8d006b801c5e92bb86954a981c240a5ba792e799e0134ff438c3b20a7b"},"schema_version":"1.0"},"canonical_sha256":"d7fdd57ad0772fcea1214b468a4e3485a73d6f6c5de3ed8d9b19cbaf1277cd53","source":{"kind":"arxiv","id":"1310.0919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0919","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0919v1","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0919","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"2765K6WQO4X4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2765K6WQO4X45IJB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2765K6WQ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2765K6WQO4X45IJBJNDIUTRUQW","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-10-03T08:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"9b508ab11bead8ac32595d95a6375b6476e9bbdb5428c0bc6d0e8aba3be0bb02","abstract_canon_sha256":"b806db8d006b801c5e92bb86954a981c240a5ba792e799e0134ff438c3b20a7b"},"schema_version":"1.0"},"canonical_sha256":"d7fdd57ad0772fcea1214b468a4e3485a73d6f6c5de3ed8d9b19cbaf1277cd53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:25.018705Z","signature_b64":"BKtnpWXPmS00sIG7+A66dppgaZDLeyVlqXSCKgEqVonOauQyvI18xlD58DMyz1D7y0j+4MWM/KA7J99rM+GLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7fdd57ad0772fcea1214b468a4e3485a73d6f6c5de3ed8d9b19cbaf1277cd53","last_reissued_at":"2026-05-18T03:11:25.017882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:25.017882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0919","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1YnkVp79achcKr6VWuAQ+d3+Vm7t0rxeEX/5zgRIGoY0SSMnrOD8QgodFez16t99Gwy+vilqxXOWfNIRIA4yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:02:12.428445Z"},"content_sha256":"757f1ae4ff494f57f33bb27feea9a1cb1a16d8b2d96036353ad3340e24b928d6","schema_version":"1.0","event_id":"sha256:757f1ae4ff494f57f33bb27feea9a1cb1a16d8b2d96036353ad3340e24b928d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2765K6WQO4X45IJBJNDIUTRUQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of Associative and Commutative Unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Atsuhiro Takasu, Takeyuki Tamura, Tatsuya Akutsu","submitted_at":"2013-10-03T08:00:43Z","abstract_excerpt":"This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and associative-commutative unification problems are $W[1]$-hard. A fixed-parameter algorithm and a polynomial-time algorithm are presented for special cases of commutative unification in which one input term is variable-free and the number of variables is bounded by a constant, respectively. Related results including those on the string and tree edit distance problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0919","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLJ5rpRid0oU+kS8VvuE9w4Kn/AkZvnsw3fwZ0duYhtnGQz+MBOE89VzssGkoaHazxGiyoWd55fJdS2OjtF7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:02:12.429110Z"},"content_sha256":"172d0cb2b5e63c61383b0ac535d01ba736e346db6030a47a7ba95dd317312d77","schema_version":"1.0","event_id":"sha256:172d0cb2b5e63c61383b0ac535d01ba736e346db6030a47a7ba95dd317312d77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2765K6WQO4X45IJBJNDIUTRUQW/bundle.json","state_url":"https://pith.science/pith/2765K6WQO4X45IJBJNDIUTRUQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2765K6WQO4X45IJBJNDIUTRUQW/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-31T22:02:12Z","links":{"resolver":"https://pith.science/pith/2765K6WQO4X45IJBJNDIUTRUQW","bundle":"https://pith.science/pith/2765K6WQO4X45IJBJNDIUTRUQW/bundle.json","state":"https://pith.science/pith/2765K6WQO4X45IJBJNDIUTRUQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2765K6WQO4X45IJBJNDIUTRUQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2765K6WQO4X45IJBJNDIUTRUQW","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":"b806db8d006b801c5e92bb86954a981c240a5ba792e799e0134ff438c3b20a7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-10-03T08:00:43Z","title_canon_sha256":"9b508ab11bead8ac32595d95a6375b6476e9bbdb5428c0bc6d0e8aba3be0bb02"},"schema_version":"1.0","source":{"id":"1310.0919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0919","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0919v1","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0919","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"2765K6WQO4X4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2765K6WQO4X45IJB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2765K6WQ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:172d0cb2b5e63c61383b0ac535d01ba736e346db6030a47a7ba95dd317312d77","target":"graph","created_at":"2026-05-18T03:11:25Z","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":"This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and associative-commutative unification problems are $W[1]$-hard. A fixed-parameter algorithm and a polynomial-time algorithm are presented for special cases of commutative unification in which one input term is variable-free and the number of variables is bounded by a constant, respectively. Related results including those on the string and tree edit distance problem","authors_text":"Atsuhiro Takasu, Takeyuki Tamura, Tatsuya Akutsu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-10-03T08:00:43Z","title":"On the Parameterized Complexity of Associative and Commutative Unification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0919","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:757f1ae4ff494f57f33bb27feea9a1cb1a16d8b2d96036353ad3340e24b928d6","target":"record","created_at":"2026-05-18T03:11:25Z","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":"b806db8d006b801c5e92bb86954a981c240a5ba792e799e0134ff438c3b20a7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-10-03T08:00:43Z","title_canon_sha256":"9b508ab11bead8ac32595d95a6375b6476e9bbdb5428c0bc6d0e8aba3be0bb02"},"schema_version":"1.0","source":{"id":"1310.0919","kind":"arxiv","version":1}},"canonical_sha256":"d7fdd57ad0772fcea1214b468a4e3485a73d6f6c5de3ed8d9b19cbaf1277cd53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7fdd57ad0772fcea1214b468a4e3485a73d6f6c5de3ed8d9b19cbaf1277cd53","first_computed_at":"2026-05-18T03:11:25.017882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:25.017882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BKtnpWXPmS00sIG7+A66dppgaZDLeyVlqXSCKgEqVonOauQyvI18xlD58DMyz1D7y0j+4MWM/KA7J99rM+GLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:25.018705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:757f1ae4ff494f57f33bb27feea9a1cb1a16d8b2d96036353ad3340e24b928d6","sha256:172d0cb2b5e63c61383b0ac535d01ba736e346db6030a47a7ba95dd317312d77"],"state_sha256":"24185fd6c5da8173eeef07086526e49b9cdc7f6ea9d710e9c9831107b05db855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLaP12ZBwTT4XUXKqs4DPwDVGTIWy04mCm0Dav8xWxlRVxTFx00ByM8SaHksBIs+JwCYREA9TuFx9w/oSL6SBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:02:12.432837Z","bundle_sha256":"280159768ecc17c81b2fec68d4936d3948f0742032cf4d1c3d5abe12aa6eb8c9"}}