{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FQDMPFCKRMYRAG5MKAFI7VJFGW","short_pith_number":"pith:FQDMPFCK","canonical_record":{"source":{"id":"1411.3164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-12T13:09:13Z","cross_cats_sorted":["cs.DS","cs.LO"],"title_canon_sha256":"805e0671f7455c552ede46ec7c0ab2138af54ce277172b63dd61cc46fe92719c","abstract_canon_sha256":"af8d3455b86f68ea88ff93a6b46a9b5f7e1d8506362a34c36623f0a43b29f94a"},"schema_version":"1.0"},"canonical_sha256":"2c06c7944a8b31101bac500a8fd52535a783bf2bb2b1857e5af4bcc6ebc12cb4","source":{"kind":"arxiv","id":"1411.3164","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3164","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3164v2","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3164","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"FQDMPFCKRMYR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FQDMPFCKRMYRAG5M","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FQDMPFCK","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FQDMPFCKRMYRAG5MKAFI7VJFGW","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-12T13:09:13Z","cross_cats_sorted":["cs.DS","cs.LO"],"title_canon_sha256":"805e0671f7455c552ede46ec7c0ab2138af54ce277172b63dd61cc46fe92719c","abstract_canon_sha256":"af8d3455b86f68ea88ff93a6b46a9b5f7e1d8506362a34c36623f0a43b29f94a"},"schema_version":"1.0"},"canonical_sha256":"2c06c7944a8b31101bac500a8fd52535a783bf2bb2b1857e5af4bcc6ebc12cb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.189236Z","signature_b64":"dt96127dsE+wMSc4KuQ2N4pI0yZeMNQOXIL0De11tnq0S5DaBOX2g9oV9oNsPOtjr8IRyke2/lEJUqtHCHvJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c06c7944a8b31101bac500a8fd52535a783bf2bb2b1857e5af4bcc6ebc12cb4","last_reissued_at":"2026-05-18T01:26:58.188596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.188596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3164","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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZfUSsjidXz9vPfXvFjRvlBAO8nqwg3m5eIG6vCwd2C2b9TN2G9g4ToERMSbfnRd0KlN6rIm8i/fUX4L/Iw5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:26:23.067729Z"},"content_sha256":"e7b0b1e2d1b825f463bd952fe9e993af88afe02b2eea738d52700a7f0ddc0b7e","schema_version":"1.0","event_id":"sha256:e7b0b1e2d1b825f463bd952fe9e993af88afe02b2eea738d52700a7f0ddc0b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FQDMPFCKRMYRAG5MKAFI7VJFGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear time algorithm for the orbit problem over cyclic groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Anthony Widjaja Lin, Sanming Zhou","submitted_at":"2014-11-12T13:09:13Z","abstract_excerpt":"The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same orbit with respect to a given finite permutation group (represented by their generators) acting on this set of configurations by permuting indices. It is known that the problem is in general as hard as the graph isomorphism problem, whose precise complexity (whether it is solvable in polynomial-time) is a long-standing open problem. In this paper, we consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3164","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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQZKfXSh5J963ng25cXi+iXFSCGRC/VE8F7+jQ+YvkU8RPDh/IHOLHR2R0XNpEnn7hB7SPxhNL5madaNDB5bDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:26:23.068305Z"},"content_sha256":"e816fb431c597896284006f0d9e35cc6a44a28889939871f1e04ae20508fcd70","schema_version":"1.0","event_id":"sha256:e816fb431c597896284006f0d9e35cc6a44a28889939871f1e04ae20508fcd70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW/bundle.json","state_url":"https://pith.science/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW/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-06-08T06:26:23Z","links":{"resolver":"https://pith.science/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW","bundle":"https://pith.science/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW/bundle.json","state":"https://pith.science/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQDMPFCKRMYRAG5MKAFI7VJFGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FQDMPFCKRMYRAG5MKAFI7VJFGW","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":"af8d3455b86f68ea88ff93a6b46a9b5f7e1d8506362a34c36623f0a43b29f94a","cross_cats_sorted":["cs.DS","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-12T13:09:13Z","title_canon_sha256":"805e0671f7455c552ede46ec7c0ab2138af54ce277172b63dd61cc46fe92719c"},"schema_version":"1.0","source":{"id":"1411.3164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3164","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3164v2","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3164","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"FQDMPFCKRMYR","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FQDMPFCKRMYRAG5M","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FQDMPFCK","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e816fb431c597896284006f0d9e35cc6a44a28889939871f1e04ae20508fcd70","target":"graph","created_at":"2026-05-18T01:26:58Z","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 orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same orbit with respect to a given finite permutation group (represented by their generators) acting on this set of configurations by permuting indices. It is known that the problem is in general as hard as the graph isomorphism problem, whose precise complexity (whether it is solvable in polynomial-time) is a long-standing open problem. In this paper, we consid","authors_text":"Anthony Widjaja Lin, Sanming Zhou","cross_cats":["cs.DS","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-12T13:09:13Z","title":"A linear time algorithm for the orbit problem over cyclic groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3164","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:e7b0b1e2d1b825f463bd952fe9e993af88afe02b2eea738d52700a7f0ddc0b7e","target":"record","created_at":"2026-05-18T01:26:58Z","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":"af8d3455b86f68ea88ff93a6b46a9b5f7e1d8506362a34c36623f0a43b29f94a","cross_cats_sorted":["cs.DS","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-12T13:09:13Z","title_canon_sha256":"805e0671f7455c552ede46ec7c0ab2138af54ce277172b63dd61cc46fe92719c"},"schema_version":"1.0","source":{"id":"1411.3164","kind":"arxiv","version":2}},"canonical_sha256":"2c06c7944a8b31101bac500a8fd52535a783bf2bb2b1857e5af4bcc6ebc12cb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c06c7944a8b31101bac500a8fd52535a783bf2bb2b1857e5af4bcc6ebc12cb4","first_computed_at":"2026-05-18T01:26:58.188596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:58.188596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dt96127dsE+wMSc4KuQ2N4pI0yZeMNQOXIL0De11tnq0S5DaBOX2g9oV9oNsPOtjr8IRyke2/lEJUqtHCHvJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:58.189236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7b0b1e2d1b825f463bd952fe9e993af88afe02b2eea738d52700a7f0ddc0b7e","sha256:e816fb431c597896284006f0d9e35cc6a44a28889939871f1e04ae20508fcd70"],"state_sha256":"a141b8fc75b54a3a58c39889bd10370d172fee120a7ab84b428526bedf817bc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgtMlH1vujTSKg0tOyoFZjMOFLp1rYRSyZwcdzip5RDTzwBTBrN37fHLjPYQKbS95UFRWKbaflWDNzSfd9gFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:26:23.071857Z","bundle_sha256":"a99e9859bfe1132cb2f2363ea9fbb273a9f76724d55ccc307c9dc57ad2520976"}}