{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RLL5NXXZCRF7X2PMLOGSOTANOH","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":"d0362f554974111a5ab1e5a8b74fe7bc27abdb0bf9d7895a9efee96d51afd661","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2025-04-07T23:47:12Z","title_canon_sha256":"42e1783b530b860632fcb75fda79f51fa994de47311e2b67b93145a2ca943435"},"schema_version":"1.0","source":{"id":"2504.05566","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05566","created_at":"2026-06-19T16:10:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05566v3","created_at":"2026-06-19T16:10:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05566","created_at":"2026-06-19T16:10:29Z"},{"alias_kind":"pith_short_12","alias_value":"RLL5NXXZCRF7","created_at":"2026-06-19T16:10:29Z"},{"alias_kind":"pith_short_16","alias_value":"RLL5NXXZCRF7X2PM","created_at":"2026-06-19T16:10:29Z"},{"alias_kind":"pith_short_8","alias_value":"RLL5NXXZ","created_at":"2026-06-19T16:10:29Z"}],"graph_snapshots":[{"event_id":"sha256:02fd12845ffc42b3ad6f24a4c39ef8e1d55d33f159d7119389fbc2341f4827f7","target":"graph","created_at":"2026-06-19T16:10:29Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Various classification-theoretic properties are or are not preserved under trace definability, and the properties which are preserved can also be characterized in terms of it."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The introduced notion of trace definability is a coherent and useful weakening of ordinary definability that interacts meaningfully with the classification-theoretic properties under consideration."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces trace definability for first-order structures and establishes preservation and characterization results for classification-theoretic properties under it."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Trace definability is a weakening of definability under which some classification-theoretic properties are preserved and can be characterized."}],"snapshot_sha256":"1260cc163855f118e09b9e03bee6152cb2b548bba762e7636b955e604838759f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ce1e17c02261f5f487fafb81b4ce97e22b7e7162ab92555d44179f07768edef8"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.05566/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of it.","authors_text":"Erik Walsberg","cross_cats":[],"headline":"Trace definability is a weakening of definability under which some classification-theoretic properties are preserved and can be characterized.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2025-04-07T23:47:12Z","title":"Trace definability I: preservation and characterizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05566","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-22T21:16:37.689757Z","id":"670f62ed-4986-4f86-befa-5ec25ee8caeb","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces trace definability for first-order structures and establishes preservation and characterization results for classification-theoretic properties under it.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Trace definability is a weakening of definability under which some classification-theoretic properties are preserved and can be characterized.","strongest_claim":"Various classification-theoretic properties are or are not preserved under trace definability, and the properties which are preserved can also be characterized in terms of it.","weakest_assumption":"The introduced notion of trace definability is a coherent and useful weakening of ordinary definability that interacts meaningfully with the classification-theoretic properties under consideration."}},"verdict_id":"670f62ed-4986-4f86-befa-5ec25ee8caeb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4a2c2ff10426668b121e277e2ec343d75a9f4e259d916c20f401f6c492d96ca8","target":"record","created_at":"2026-06-19T16:10:29Z","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":"d0362f554974111a5ab1e5a8b74fe7bc27abdb0bf9d7895a9efee96d51afd661","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2025-04-07T23:47:12Z","title_canon_sha256":"42e1783b530b860632fcb75fda79f51fa994de47311e2b67b93145a2ca943435"},"schema_version":"1.0","source":{"id":"2504.05566","kind":"arxiv","version":3}},"canonical_sha256":"8ad7d6def9144bfbe9ec5b8d274c0d71fedabb1deb2136ed5430f9b5a66495df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ad7d6def9144bfbe9ec5b8d274c0d71fedabb1deb2136ed5430f9b5a66495df","first_computed_at":"2026-06-19T16:10:29.614885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:29.614885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+oIy4NBunwT65VIARhiHZCC61l5DaPSSaGi/73ZiOEw2n9U7A9Olso7aXHyl1ATOJzRSsNRXODe1R7hHfI5IDQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:29.615329Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.05566","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a2c2ff10426668b121e277e2ec343d75a9f4e259d916c20f401f6c492d96ca8","sha256:02fd12845ffc42b3ad6f24a4c39ef8e1d55d33f159d7119389fbc2341f4827f7"],"state_sha256":"39f4c42da829e0a1ca236daef06280aa7babfb6f908c815c04aaec1ab88dccfd"}