{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:JTRBK3UPDD5ZY6MZO6XF6ITAE2","short_pith_number":"pith:JTRBK3UP","canonical_record":{"source":{"id":"1008.5033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-30T09:45:14Z","cross_cats_sorted":[],"title_canon_sha256":"b09743cc9a799dc84fd29b3c7e24b5bda6550c9aa5cb89ff58fd6c7d458df911","abstract_canon_sha256":"8f702f0a71116c4fe094dc153173fe2de46cf2e147dda916a6d24fd99aa1d12e"},"schema_version":"1.0"},"canonical_sha256":"4ce2156e8f18fb9c799977ae5f22602690da2e68a6ec77a86d822594260cc742","source":{"kind":"arxiv","id":"1008.5033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5033","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5033v1","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5033","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"pith_short_12","alias_value":"JTRBK3UPDD5Z","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JTRBK3UPDD5ZY6MZ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JTRBK3UP","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:JTRBK3UPDD5ZY6MZO6XF6ITAE2","target":"record","payload":{"canonical_record":{"source":{"id":"1008.5033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-30T09:45:14Z","cross_cats_sorted":[],"title_canon_sha256":"b09743cc9a799dc84fd29b3c7e24b5bda6550c9aa5cb89ff58fd6c7d458df911","abstract_canon_sha256":"8f702f0a71116c4fe094dc153173fe2de46cf2e147dda916a6d24fd99aa1d12e"},"schema_version":"1.0"},"canonical_sha256":"4ce2156e8f18fb9c799977ae5f22602690da2e68a6ec77a86d822594260cc742","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:37.251704Z","signature_b64":"JBuvuokONIYLH3OQnhRZKKo4tarRyh16dPpSpbpMO858zoEA1mQ0YJa0+pvPX0HNo8wCelQgMNf8iyS3k2P+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce2156e8f18fb9c799977ae5f22602690da2e68a6ec77a86d822594260cc742","last_reissued_at":"2026-05-18T04:41:37.251075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:37.251075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.5033","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-18T04:41:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFtgEuuIqhnE7nLH+yqhuc6Di8lHCNe2KzCmplH6LOMpVWZGy3ta0gjW18UskCX42mYKP/efEx+o89Go3MJZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:37:33.600746Z"},"content_sha256":"3767b49175a940b08f616921187b2738ba7f75a95dc41e8f58d6d3e6280238ea","schema_version":"1.0","event_id":"sha256:3767b49175a940b08f616921187b2738ba7f75a95dc41e8f58d6d3e6280238ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:JTRBK3UPDD5ZY6MZO6XF6ITAE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetry Breaking for Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christian Drescher","submitted_at":"2010-08-30T09:45:14Z","abstract_excerpt":"In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process which implicitly represent symmetries and always with exponential compression. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5033","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-18T04:41:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IYI1yNQB/EgvAxtAxlRZZ8W/1KPLJ2PNpduNqc9dsxT0JM0guzwBma8w6MYAtVWk0F5OcfMFbBApNuxINP1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:37:33.601419Z"},"content_sha256":"3263b8c0b21dc6dfc85d187c8bb3b7d965cf8f599401cd43e311a818cb839c56","schema_version":"1.0","event_id":"sha256:3263b8c0b21dc6dfc85d187c8bb3b7d965cf8f599401cd43e311a818cb839c56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2/bundle.json","state_url":"https://pith.science/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2/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-30T01:37:33Z","links":{"resolver":"https://pith.science/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2","bundle":"https://pith.science/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2/bundle.json","state":"https://pith.science/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTRBK3UPDD5ZY6MZO6XF6ITAE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JTRBK3UPDD5ZY6MZO6XF6ITAE2","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":"8f702f0a71116c4fe094dc153173fe2de46cf2e147dda916a6d24fd99aa1d12e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-30T09:45:14Z","title_canon_sha256":"b09743cc9a799dc84fd29b3c7e24b5bda6550c9aa5cb89ff58fd6c7d458df911"},"schema_version":"1.0","source":{"id":"1008.5033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5033","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5033v1","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5033","created_at":"2026-05-18T04:41:37Z"},{"alias_kind":"pith_short_12","alias_value":"JTRBK3UPDD5Z","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JTRBK3UPDD5ZY6MZ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JTRBK3UP","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:3263b8c0b21dc6dfc85d187c8bb3b7d965cf8f599401cd43e311a818cb839c56","target":"graph","created_at":"2026-05-18T04:41:37Z","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":"In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process which implicitly represent symmetries and always with exponential compression. ","authors_text":"Christian Drescher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-30T09:45:14Z","title":"Symmetry Breaking for Answer Set Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5033","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:3767b49175a940b08f616921187b2738ba7f75a95dc41e8f58d6d3e6280238ea","target":"record","created_at":"2026-05-18T04:41:37Z","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":"8f702f0a71116c4fe094dc153173fe2de46cf2e147dda916a6d24fd99aa1d12e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-30T09:45:14Z","title_canon_sha256":"b09743cc9a799dc84fd29b3c7e24b5bda6550c9aa5cb89ff58fd6c7d458df911"},"schema_version":"1.0","source":{"id":"1008.5033","kind":"arxiv","version":1}},"canonical_sha256":"4ce2156e8f18fb9c799977ae5f22602690da2e68a6ec77a86d822594260cc742","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ce2156e8f18fb9c799977ae5f22602690da2e68a6ec77a86d822594260cc742","first_computed_at":"2026-05-18T04:41:37.251075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:37.251075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBuvuokONIYLH3OQnhRZKKo4tarRyh16dPpSpbpMO858zoEA1mQ0YJa0+pvPX0HNo8wCelQgMNf8iyS3k2P+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:37.251704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.5033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3767b49175a940b08f616921187b2738ba7f75a95dc41e8f58d6d3e6280238ea","sha256:3263b8c0b21dc6dfc85d187c8bb3b7d965cf8f599401cd43e311a818cb839c56"],"state_sha256":"91ac517b2276569af8f14b304d0cc7ce35a21ea3c83d69dacdb61898e03abc93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwxPf/AzcpHUe7NzSqJf8qj5uHqqvzHlz9DvGPVA77RFPhdfs3IOGEfHiCn5FF3Il3JHlOeRGbBHgohEWrbbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:37:33.605010Z","bundle_sha256":"cb886160f81b493dfe59eebc50d24868cfcb4b302071b987db753208e7508ca5"}}