{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3Y5UVD66DB7ATOS4DHGI2L33LL","short_pith_number":"pith:3Y5UVD66","schema_version":"1.0","canonical_sha256":"de3b4a8fde187e09ba5c19cc8d2f7b5ad29988c2db832a9bf1307e1a91c2a7e8","source":{"kind":"arxiv","id":"1906.03641","version":2},"attestation_state":"computed","paper":{"title":"A Local Resolution of the Problem of Time. VII. Constraint Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"gr-qc","authors_text":"Edward Anderson","submitted_at":"2019-06-09T13:37:57Z","abstract_excerpt":"We now set up Constraint Closure in a manner consistent with Temporal and Configurational Relationalism. This requires modifying the Dirac Algorithm - which addresses the Constraint Closure Problem facet of the Problem of Time piecemeal - to the TRi-Dirac Algorithm. This is a member of the wider class of Dirac-type algorithms that enjoys the property of being Temporal Relationalism implementing (TRi). Constraint algebraic structures ensue. We include examples of types of constraint, outcomes of the Dirac Algorithm and different kinds of Constraint Closure Problems. Enough new Principles of Dyn"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.03641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"gr-qc","submitted_at":"2019-06-09T13:37:57Z","cross_cats_sorted":[],"title_canon_sha256":"ca40282eb647bcf1d0fa5323992dccb46aa898ab7f1c4be87af80ed0c14e390d","abstract_canon_sha256":"164d50efa8f925af831261b2e9d4c3b8d72a8a3cb2539d932705c94e2e1e0411"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:07.864128Z","signature_b64":"pXnEw8nW6uFhcc+2jwS61uTdYKCSJMRsKmzy3WdyKbdEp60ag1wBog+ueVG9oztNc1tkmoeX7Eg0YN2WVwA/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de3b4a8fde187e09ba5c19cc8d2f7b5ad29988c2db832a9bf1307e1a91c2a7e8","last_reissued_at":"2026-05-17T23:41:07.863310Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:07.863310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Local Resolution of the Problem of Time. VII. Constraint Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"gr-qc","authors_text":"Edward Anderson","submitted_at":"2019-06-09T13:37:57Z","abstract_excerpt":"We now set up Constraint Closure in a manner consistent with Temporal and Configurational Relationalism. This requires modifying the Dirac Algorithm - which addresses the Constraint Closure Problem facet of the Problem of Time piecemeal - to the TRi-Dirac Algorithm. This is a member of the wider class of Dirac-type algorithms that enjoys the property of being Temporal Relationalism implementing (TRi). Constraint algebraic structures ensue. We include examples of types of constraint, outcomes of the Dirac Algorithm and different kinds of Constraint Closure Problems. Enough new Principles of Dyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03641","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.03641","created_at":"2026-05-17T23:41:07.863471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03641v2","created_at":"2026-05-17T23:41:07.863471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03641","created_at":"2026-05-17T23:41:07.863471+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Y5UVD66DB7A","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Y5UVD66DB7ATOS4","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Y5UVD66","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00912","citing_title":"Problem of Time and Background Independence: classical version's higher Lie Theory","ref_index":81,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL","json":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL.json","graph_json":"https://pith.science/api/pith-number/3Y5UVD66DB7ATOS4DHGI2L33LL/graph.json","events_json":"https://pith.science/api/pith-number/3Y5UVD66DB7ATOS4DHGI2L33LL/events.json","paper":"https://pith.science/paper/3Y5UVD66"},"agent_actions":{"view_html":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL","download_json":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL.json","view_paper":"https://pith.science/paper/3Y5UVD66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03641&json=true","fetch_graph":"https://pith.science/api/pith-number/3Y5UVD66DB7ATOS4DHGI2L33LL/graph.json","fetch_events":"https://pith.science/api/pith-number/3Y5UVD66DB7ATOS4DHGI2L33LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL/action/storage_attestation","attest_author":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL/action/author_attestation","sign_citation":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL/action/citation_signature","submit_replication":"https://pith.science/pith/3Y5UVD66DB7ATOS4DHGI2L33LL/action/replication_record"}},"created_at":"2026-05-17T23:41:07.863471+00:00","updated_at":"2026-05-17T23:41:07.863471+00:00"}