{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D23DRM5RSPPO74YOOKQEX74RFF","short_pith_number":"pith:D23DRM5R","canonical_record":{"source":{"id":"1301.6424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T01:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"c1e2c6c3861716f7772cadb4797a35259901e00b0b9db2e76adc6fa38e7c8e1a","abstract_canon_sha256":"eeaa5013eba6e6bd577ad87f71f0dacef5f91d052066afd9cdbb795918d3a43d"},"schema_version":"1.0"},"canonical_sha256":"1eb638b3b193deeff30e72a04bff91296292144ad272553999bc7a1659e8a039","source":{"kind":"arxiv","id":"1301.6424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6424","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6424v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6424","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"D23DRM5RSPPO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D23DRM5RSPPO74YO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D23DRM5R","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D23DRM5RSPPO74YOOKQEX74RFF","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T01:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"c1e2c6c3861716f7772cadb4797a35259901e00b0b9db2e76adc6fa38e7c8e1a","abstract_canon_sha256":"eeaa5013eba6e6bd577ad87f71f0dacef5f91d052066afd9cdbb795918d3a43d"},"schema_version":"1.0"},"canonical_sha256":"1eb638b3b193deeff30e72a04bff91296292144ad272553999bc7a1659e8a039","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.404264Z","signature_b64":"XnT/yiLUT9jfUg1OI5E00o8QAPHxV7UQnMm05w87taJM1u08DiThPlReG4rbzlgqhnZOz0TaFGMASvwoBNsrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb638b3b193deeff30e72a04bff91296292144ad272553999bc7a1659e8a039","last_reissued_at":"2026-05-18T03:35:15.403516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.403516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6424","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-18T03:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q2BBuhgELQxXdNlkeeafuDw0l/dzPnJeva+id/y6ktHA8TM+Xe/348sMNe8tNGzMf+vvgIhgIRR8DhGeSLfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:09:07.996215Z"},"content_sha256":"8568164cd361cd412111d257368bb82b53670adb2a7c8b11acf1200a9429213b","schema_version":"1.0","event_id":"sha256:8568164cd361cd412111d257368bb82b53670adb2a7c8b11acf1200a9429213b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D23DRM5RSPPO74YOOKQEX74RFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Skolem sequences via generating trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Yen, Sophie Burrill","submitted_at":"2013-01-28T01:40:56Z","abstract_excerpt":"A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the method of generating trees for open arc diagrams to generate exhaustively all Skolem sequences of a given size. Tracking the arc length between pairs of vertices in an arc annotated diagram is the central task. Although we do not surpass previously known enumerative results, this method drastically reduces the search space compared to previously known methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6424","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-18T03:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLH3moi62lDqbEFdxlqeStlDAA1Nwxd2AIpdqCAWoywFdY3iib+eLGSkaGSgW3Bb+GFuAzLWp7FeFK/Gj12SAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:09:07.996959Z"},"content_sha256":"2cba115fbd03c7d14f3572bf4f89ca00d11587a6582dabe60854270be51c0625","schema_version":"1.0","event_id":"sha256:2cba115fbd03c7d14f3572bf4f89ca00d11587a6582dabe60854270be51c0625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D23DRM5RSPPO74YOOKQEX74RFF/bundle.json","state_url":"https://pith.science/pith/D23DRM5RSPPO74YOOKQEX74RFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D23DRM5RSPPO74YOOKQEX74RFF/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-06-09T18:09:07Z","links":{"resolver":"https://pith.science/pith/D23DRM5RSPPO74YOOKQEX74RFF","bundle":"https://pith.science/pith/D23DRM5RSPPO74YOOKQEX74RFF/bundle.json","state":"https://pith.science/pith/D23DRM5RSPPO74YOOKQEX74RFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D23DRM5RSPPO74YOOKQEX74RFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D23DRM5RSPPO74YOOKQEX74RFF","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":"eeaa5013eba6e6bd577ad87f71f0dacef5f91d052066afd9cdbb795918d3a43d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T01:40:56Z","title_canon_sha256":"c1e2c6c3861716f7772cadb4797a35259901e00b0b9db2e76adc6fa38e7c8e1a"},"schema_version":"1.0","source":{"id":"1301.6424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6424","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6424v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6424","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"D23DRM5RSPPO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D23DRM5RSPPO74YO","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D23DRM5R","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:2cba115fbd03c7d14f3572bf4f89ca00d11587a6582dabe60854270be51c0625","target":"graph","created_at":"2026-05-18T03:35:15Z","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":"A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the method of generating trees for open arc diagrams to generate exhaustively all Skolem sequences of a given size. Tracking the arc length between pairs of vertices in an arc annotated diagram is the central task. Although we do not surpass previously known enumerative results, this method drastically reduces the search space compared to previously known methods","authors_text":"Lily Yen, Sophie Burrill","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T01:40:56Z","title":"Constructing Skolem sequences via generating trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6424","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:8568164cd361cd412111d257368bb82b53670adb2a7c8b11acf1200a9429213b","target":"record","created_at":"2026-05-18T03:35:15Z","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":"eeaa5013eba6e6bd577ad87f71f0dacef5f91d052066afd9cdbb795918d3a43d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T01:40:56Z","title_canon_sha256":"c1e2c6c3861716f7772cadb4797a35259901e00b0b9db2e76adc6fa38e7c8e1a"},"schema_version":"1.0","source":{"id":"1301.6424","kind":"arxiv","version":1}},"canonical_sha256":"1eb638b3b193deeff30e72a04bff91296292144ad272553999bc7a1659e8a039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eb638b3b193deeff30e72a04bff91296292144ad272553999bc7a1659e8a039","first_computed_at":"2026-05-18T03:35:15.403516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:15.403516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XnT/yiLUT9jfUg1OI5E00o8QAPHxV7UQnMm05w87taJM1u08DiThPlReG4rbzlgqhnZOz0TaFGMASvwoBNsrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:15.404264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8568164cd361cd412111d257368bb82b53670adb2a7c8b11acf1200a9429213b","sha256:2cba115fbd03c7d14f3572bf4f89ca00d11587a6582dabe60854270be51c0625"],"state_sha256":"d256a46a720318b2c0d39d34f99a3fa918d5df406a753ffaa3b6888bd8b07b01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTMT7i6omWDo1bvxBVj4xitC8VjzLDMPmWTIkDk0+L5epwzlS0DYD1sp8ieI5mYUkPkh6SRongfMDbBIwX5LDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:09:08.001001Z","bundle_sha256":"b0f93fd3fec6f3f21a3a08f8bd6552a4394e45508ba3fa6332a3fb72d9e007f9"}}