{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TXYAOKTSD3NV6KZCVYUGHQC23M","short_pith_number":"pith:TXYAOKTS","canonical_record":{"source":{"id":"1408.3644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-15T20:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"67342005b177ee6f360ebdda3751de1d7d80505ac63d2c77819cd68bb79d9551","abstract_canon_sha256":"37b78b55708647784995af8cf3b342fe816ef11112020e4d1259d4e458a6a549"},"schema_version":"1.0"},"canonical_sha256":"9df0072a721edb5f2b22ae2863c05adb350f13d7357ef5d9efe882d8c04d0c85","source":{"kind":"arxiv","id":"1408.3644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3644","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3644v1","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3644","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"TXYAOKTSD3NV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXYAOKTSD3NV6KZC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXYAOKTS","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TXYAOKTSD3NV6KZCVYUGHQC23M","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-15T20:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"67342005b177ee6f360ebdda3751de1d7d80505ac63d2c77819cd68bb79d9551","abstract_canon_sha256":"37b78b55708647784995af8cf3b342fe816ef11112020e4d1259d4e458a6a549"},"schema_version":"1.0"},"canonical_sha256":"9df0072a721edb5f2b22ae2863c05adb350f13d7357ef5d9efe882d8c04d0c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:32.023626Z","signature_b64":"88OFukFRaKhlNGyTcEbYVuLUFUiGN+m5WlhFSbdclWB38eqeLs0mZqSVb31/HGTSAsE+hyvIzjVSu5nlhhX6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df0072a721edb5f2b22ae2863c05adb350f13d7357ef5d9efe882d8c04d0c85","last_reissued_at":"2026-05-18T01:29:32.022972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:32.022972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3644","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-18T01:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UPVRIAMYRRrmfgzNovnftldpk62fOe2Khdh8AcRxpFWTZtet8gADd4SvG8++sbq8kZ+kWhgVD4kqYLRDF8OqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:20.747905Z"},"content_sha256":"10e34182726b651726392cc4f05dd2e03a76ecef216bfa4e2fd3e85dfa69bd05","schema_version":"1.0","event_id":"sha256:10e34182726b651726392cc4f05dd2e03a76ecef216bfa4e2fd3e85dfa69bd05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TXYAOKTSD3NV6KZCVYUGHQC23M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer sequence discovery from small graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna Petrone, Travis Hoppe","submitted_at":"2014-08-15T20:16:32Z","abstract_excerpt":"We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and 6 sequences were appended or corrected. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3644","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-18T01:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjCNYUlnFSOyPh5NTV1Av+NpDGn0FGWOZ8lQObQrE3b3aG1CXSwoj94sri0KYDybA4JRWWc1wcq1AC0FOTdKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:20.748335Z"},"content_sha256":"9bb6b7cf49e310f05448b3da2a1a5d0ac7a4febda95b0c83858edc437d0b4b2b","schema_version":"1.0","event_id":"sha256:9bb6b7cf49e310f05448b3da2a1a5d0ac7a4febda95b0c83858edc437d0b4b2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXYAOKTSD3NV6KZCVYUGHQC23M/bundle.json","state_url":"https://pith.science/pith/TXYAOKTSD3NV6KZCVYUGHQC23M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXYAOKTSD3NV6KZCVYUGHQC23M/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-05-25T17:01:20Z","links":{"resolver":"https://pith.science/pith/TXYAOKTSD3NV6KZCVYUGHQC23M","bundle":"https://pith.science/pith/TXYAOKTSD3NV6KZCVYUGHQC23M/bundle.json","state":"https://pith.science/pith/TXYAOKTSD3NV6KZCVYUGHQC23M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXYAOKTSD3NV6KZCVYUGHQC23M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TXYAOKTSD3NV6KZCVYUGHQC23M","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":"37b78b55708647784995af8cf3b342fe816ef11112020e4d1259d4e458a6a549","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-15T20:16:32Z","title_canon_sha256":"67342005b177ee6f360ebdda3751de1d7d80505ac63d2c77819cd68bb79d9551"},"schema_version":"1.0","source":{"id":"1408.3644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3644","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3644v1","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3644","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"TXYAOKTSD3NV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXYAOKTSD3NV6KZC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXYAOKTS","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:9bb6b7cf49e310f05448b3da2a1a5d0ac7a4febda95b0c83858edc437d0b4b2b","target":"graph","created_at":"2026-05-18T01:29:32Z","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":"We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and 6 sequences were appended or corrected. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for furth","authors_text":"Anna Petrone, Travis Hoppe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-15T20:16:32Z","title":"Integer sequence discovery from small graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3644","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:10e34182726b651726392cc4f05dd2e03a76ecef216bfa4e2fd3e85dfa69bd05","target":"record","created_at":"2026-05-18T01:29:32Z","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":"37b78b55708647784995af8cf3b342fe816ef11112020e4d1259d4e458a6a549","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-15T20:16:32Z","title_canon_sha256":"67342005b177ee6f360ebdda3751de1d7d80505ac63d2c77819cd68bb79d9551"},"schema_version":"1.0","source":{"id":"1408.3644","kind":"arxiv","version":1}},"canonical_sha256":"9df0072a721edb5f2b22ae2863c05adb350f13d7357ef5d9efe882d8c04d0c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9df0072a721edb5f2b22ae2863c05adb350f13d7357ef5d9efe882d8c04d0c85","first_computed_at":"2026-05-18T01:29:32.022972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:32.022972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88OFukFRaKhlNGyTcEbYVuLUFUiGN+m5WlhFSbdclWB38eqeLs0mZqSVb31/HGTSAsE+hyvIzjVSu5nlhhX6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:32.023626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10e34182726b651726392cc4f05dd2e03a76ecef216bfa4e2fd3e85dfa69bd05","sha256:9bb6b7cf49e310f05448b3da2a1a5d0ac7a4febda95b0c83858edc437d0b4b2b"],"state_sha256":"c4cc1cd504efa38b197f212f5b816e88e0ee81b582c47b362f43ee2001d985bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8MTX/o7NAN0ZkANw63iBSNwV0Qc/pRaimnmE0FSYyJxGYBabDbAf8niR+ODx4B7twdLn1OorimRc3INmycmaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:01:20.751261Z","bundle_sha256":"dd5fa1da2d3b7c5b3afd5e23a894d0f68fb4aac4b77649feb984eeb4e12f713d"}}