{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KNUK6VFP7FHHK7XRQUPLJCIV55","short_pith_number":"pith:KNUK6VFP","schema_version":"1.0","canonical_sha256":"5368af54aff94e757ef1851eb48915ef639df55c4190530a690ec110602e75d8","source":{"kind":"arxiv","id":"1412.6060","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Structure of the Deterministic Seriation Method with Multiple Subset Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.AI","authors_text":"Carl P. Lipo, Mark E. Madsen","submitted_at":"2014-12-13T00:48:48Z","abstract_excerpt":"Seriation methods order a set of descriptions given some criterion (e.g., unimodality or minimum distance between similarity scores). Seriation is thus inherently a problem of finding the optimal solution among a set of permutations of objects. In this short technical note, we review the combinatorial structure of the classical seriation problem, which seeks a single solution out of a set of objects. We then extend those results to the iterative frequency seriation approach introduced by Lipo (1997), which finds optimal subsets of objects which each satisfy the unimodality criterion within eac"},"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":"1412.6060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-13T00:48:48Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"cc4964114000bebe03cdea5793315edfe56b3c7fee172c852c7dc42962f765d1","abstract_canon_sha256":"db10a9831ff95697527ffc9ec1dfe09e0f56cd063e0329a877649f965b16056e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:55.591043Z","signature_b64":"n9MnmmI44mSV678CSl/9qYY5TA7YR7+F4usibtUD1Hq4y2PX1mnl/cTM/1r6YVdSY3DFP4r7hhCHgHTKy51JAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5368af54aff94e757ef1851eb48915ef639df55c4190530a690ec110602e75d8","last_reissued_at":"2026-05-18T02:30:55.590418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:55.590418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Structure of the Deterministic Seriation Method with Multiple Subset Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.AI","authors_text":"Carl P. Lipo, Mark E. Madsen","submitted_at":"2014-12-13T00:48:48Z","abstract_excerpt":"Seriation methods order a set of descriptions given some criterion (e.g., unimodality or minimum distance between similarity scores). Seriation is thus inherently a problem of finding the optimal solution among a set of permutations of objects. In this short technical note, we review the combinatorial structure of the classical seriation problem, which seeks a single solution out of a set of objects. We then extend those results to the iterative frequency seriation approach introduced by Lipo (1997), which finds optimal subsets of objects which each satisfy the unimodality criterion within eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6060","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6060","created_at":"2026-05-18T02:30:55.590526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6060v1","created_at":"2026-05-18T02:30:55.590526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6060","created_at":"2026-05-18T02:30:55.590526+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNUK6VFP7FHH","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNUK6VFP7FHHK7XR","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNUK6VFP","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55","json":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55.json","graph_json":"https://pith.science/api/pith-number/KNUK6VFP7FHHK7XRQUPLJCIV55/graph.json","events_json":"https://pith.science/api/pith-number/KNUK6VFP7FHHK7XRQUPLJCIV55/events.json","paper":"https://pith.science/paper/KNUK6VFP"},"agent_actions":{"view_html":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55","download_json":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55.json","view_paper":"https://pith.science/paper/KNUK6VFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6060&json=true","fetch_graph":"https://pith.science/api/pith-number/KNUK6VFP7FHHK7XRQUPLJCIV55/graph.json","fetch_events":"https://pith.science/api/pith-number/KNUK6VFP7FHHK7XRQUPLJCIV55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55/action/storage_attestation","attest_author":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55/action/author_attestation","sign_citation":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55/action/citation_signature","submit_replication":"https://pith.science/pith/KNUK6VFP7FHHK7XRQUPLJCIV55/action/replication_record"}},"created_at":"2026-05-18T02:30:55.590526+00:00","updated_at":"2026-05-18T02:30:55.590526+00:00"}