{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JBSL7TINUESHQKQXRB7AEL6GQS","short_pith_number":"pith:JBSL7TIN","canonical_record":{"source":{"id":"2607.10155","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-11T06:34:26Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"d0684289127372946ef70fc478123102440f27339a0b4c8bb0e0fc2abd9cf090","abstract_canon_sha256":"1f42b1ee7c18d20a59666669276946bb85606a5df3736315412b1eff20bd2789"},"schema_version":"1.0"},"canonical_sha256":"4864bfcd0da124782a17887e022fc6848a655889c24931991563d199921c7513","source":{"kind":"arxiv","id":"2607.10155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10155","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10155v1","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10155","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"JBSL7TINUESH","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"JBSL7TINUESHQKQX","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"JBSL7TIN","created_at":"2026-07-14T01:20:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JBSL7TINUESHQKQXRB7AEL6GQS","target":"record","payload":{"canonical_record":{"source":{"id":"2607.10155","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-11T06:34:26Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"d0684289127372946ef70fc478123102440f27339a0b4c8bb0e0fc2abd9cf090","abstract_canon_sha256":"1f42b1ee7c18d20a59666669276946bb85606a5df3736315412b1eff20bd2789"},"schema_version":"1.0"},"canonical_sha256":"4864bfcd0da124782a17887e022fc6848a655889c24931991563d199921c7513","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:27.929963Z","signature_b64":"m1DueQGcJorLRUIGuO9zkdgaPPHOxMlOSPsavDQTPpxY/YpDEY44yx97IrSeM/GmNeuW2Lgrmz92QhAjMcI9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4864bfcd0da124782a17887e022fc6848a655889c24931991563d199921c7513","last_reissued_at":"2026-07-14T01:20:27.929116Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:27.929116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.10155","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-07-14T01:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfcNg01XcUOgPq5ZfkIHeLh4Wm8/d+DpW9B57uEVQfEdr4dRY1pV01aftmJs4YqnzC1a9sQcKI3/v57nNHUMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:48:01.762013Z"},"content_sha256":"3ceb2e232866255e33430153ad679d77f69886d610b4ab6aafd03ffab4e930d0","schema_version":"1.0","event_id":"sha256:3ceb2e232866255e33430153ad679d77f69886d610b4ab6aafd03ffab4e930d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JBSL7TINUESHQKQXRB7AEL6GQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Carlile Lavor, Michael Souza, Wagner da Rocha","submitted_at":"2026-07-11T06:34:26Z","abstract_excerpt":"The Combinatorial Discretizable Distance Geometry Problem combines a finite binary lateration process with additional distance constraints. When predecessor sets are not consecutive, these pruning constraints interact in ways that make the symmetry-based counting methods available for molecular instances insufficient. We establish an exact, dimension-uniform counting theorem for seed-fixed feasible realizations under strict discretization and a generic feasible framework assumption. Our approach identifies partial reflections through seed-free connected components of the lateration skeleton. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10155","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.10155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-14T01:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"McdiCyumUUTjnG0gseWxT7OXOWXxgWXga9yrILbCDCqvVG5E2bM7ma7JWF8d0E7cQss7F6CzhzlQm5xWcFuCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:48:01.762716Z"},"content_sha256":"6a1054f241f3e567a87c68291b5e58d3edadf262d2833acebeed7f828a5c7b61","schema_version":"1.0","event_id":"sha256:6a1054f241f3e567a87c68291b5e58d3edadf262d2833acebeed7f828a5c7b61"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:JBSL7TINUESHQKQXRB7AEL6GQS","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.dam.2014.08.035 resolves to 'Discretization vertex orders in distance geometry'. A reader following the printed text alone cannot reach it.","snippet":"Andrea Cassioli, Oktay Günlük, Carlile Lavor, and Leo Liberti. Discretization vertex orders in distance geometry.Discrete Applied Mathematics, 197:27–41, 2015. doi: 10.1016/j.dam.2014.08. 035","arxiv_id":"2607.10155","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":"Discretization vertex orders in distance geometry","printed_excerpt":"10.1016/j.dam.2014.08","reconstructed_doi":"10.1016/j.dam.2014.08.035"},"severity":"advisory","ref_index":3,"audited_at":"2026-07-29T15:52:00.228156Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.dam.2014.08.035","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"fba9035b7254022b090d454ee802631043435ee7a2b00d80c52b0c9ff9eddb64","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Discretization vertex orders in distance geometry","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13760,"payload_sha256":"48c7b2b210f28aaf4e2cc5233353f1e28a978128f192d9cb40318d127fd662c8","signature_b64":null,"signing_key_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-29T15:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtZb5ap7SLHLEUhr3BBErI+Dtt7DA9vlNo1I8rfwJwgtNorSNj/EjoeR+GiFzUPQ+8SHWL2BZnqjnVQI4qdOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:48:01.767690Z"},"content_sha256":"0acec76507dcccde41617ac559c9b55869824855414cfa0f02f0fe33229e3f8f","schema_version":"1.0","event_id":"sha256:0acec76507dcccde41617ac559c9b55869824855414cfa0f02f0fe33229e3f8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBSL7TINUESHQKQXRB7AEL6GQS/bundle.json","state_url":"https://pith.science/pith/JBSL7TINUESHQKQXRB7AEL6GQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBSL7TINUESHQKQXRB7AEL6GQS/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-08-22T19:48:01Z","links":{"resolver":"https://pith.science/pith/JBSL7TINUESHQKQXRB7AEL6GQS","bundle":"https://pith.science/pith/JBSL7TINUESHQKQXRB7AEL6GQS/bundle.json","state":"https://pith.science/pith/JBSL7TINUESHQKQXRB7AEL6GQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBSL7TINUESHQKQXRB7AEL6GQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JBSL7TINUESHQKQXRB7AEL6GQS","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f42b1ee7c18d20a59666669276946bb85606a5df3736315412b1eff20bd2789","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-11T06:34:26Z","title_canon_sha256":"d0684289127372946ef70fc478123102440f27339a0b4c8bb0e0fc2abd9cf090"},"schema_version":"1.0","source":{"id":"2607.10155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10155","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10155v1","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10155","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"JBSL7TINUESH","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"JBSL7TINUESHQKQX","created_at":"2026-07-14T01:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"JBSL7TIN","created_at":"2026-07-14T01:20:27Z"}],"graph_snapshots":[{"event_id":"sha256:6a1054f241f3e567a87c68291b5e58d3edadf262d2833acebeed7f828a5c7b61","target":"graph","created_at":"2026-07-14T01:20:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.10155/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Combinatorial Discretizable Distance Geometry Problem combines a finite binary lateration process with additional distance constraints. When predecessor sets are not consecutive, these pruning constraints interact in ways that make the symmetry-based counting methods available for molecular instances insufficient. We establish an exact, dimension-uniform counting theorem for seed-fixed feasible realizations under strict discretization and a generic feasible framework assumption. Our approach identifies partial reflections through seed-free connected components of the lateration skeleton. T","authors_text":"Carlile Lavor, Michael Souza, Wagner da Rocha","cross_cats":["math.MG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-11T06:34:26Z","title":"A Conditional Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10155","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:3ceb2e232866255e33430153ad679d77f69886d610b4ab6aafd03ffab4e930d0","target":"record","created_at":"2026-07-14T01:20:27Z","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":"1f42b1ee7c18d20a59666669276946bb85606a5df3736315412b1eff20bd2789","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-11T06:34:26Z","title_canon_sha256":"d0684289127372946ef70fc478123102440f27339a0b4c8bb0e0fc2abd9cf090"},"schema_version":"1.0","source":{"id":"2607.10155","kind":"arxiv","version":1}},"canonical_sha256":"4864bfcd0da124782a17887e022fc6848a655889c24931991563d199921c7513","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4864bfcd0da124782a17887e022fc6848a655889c24931991563d199921c7513","first_computed_at":"2026-07-14T01:20:27.929116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:20:27.929116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m1DueQGcJorLRUIGuO9zkdgaPPHOxMlOSPsavDQTPpxY/YpDEY44yx97IrSeM/GmNeuW2Lgrmz92QhAjMcI9DA==","signature_status":"signed_v1","signed_at":"2026-07-14T01:20:27.929963Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.10155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ceb2e232866255e33430153ad679d77f69886d610b4ab6aafd03ffab4e930d0","sha256:6a1054f241f3e567a87c68291b5e58d3edadf262d2833acebeed7f828a5c7b61","sha256:0acec76507dcccde41617ac559c9b55869824855414cfa0f02f0fe33229e3f8f"],"state_sha256":"c8ba812c79612a41395e8e4fe174d3460259b8f35f8d32924c18d4b2272d06aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2dDZ0VvYxDXJolfShqr/0BMSrAiRTkDo4xGuCyU6ka84bgatN/G1FKdCZu99GZ017hyDlDzj9sa3mj5k/rtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T19:48:01.772267Z","bundle_sha256":"2abd81ed1eaed84ca60011a3f30b69e33722fd407da44a14eb3ef1095ab1e121"}}