{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4N5CKOO7RV2STWK55VQAXGXYWH","short_pith_number":"pith:4N5CKOO7","schema_version":"1.0","canonical_sha256":"e37a2539df8d7529d95ded600b9af8b1cfe1a9c932e305a96de1dfd0a45b0ef2","source":{"kind":"arxiv","id":"1710.10303","version":1},"attestation_state":"computed","paper":{"title":"Properties of the Fibonacci-sum graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrii Arman, David S. Gunderson, Pak Ching Li","submitted_at":"2017-10-27T18:55:55Z","abstract_excerpt":"For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian paths in each $G_n$ have been classified. In this paper, it is shown that each $G_n$ has at most one non-trivial automorphism, which is given explicitly. Other properties of $G_n$ are also found, including the degree sequence, the treewidth, the nature of the bipartition, and that $G_n$ is outerplanar."},"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":"1710.10303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T18:55:55Z","cross_cats_sorted":[],"title_canon_sha256":"5dc76758f3badec3510add6ec813527eefdf14f54d45f1a0a390b284809d91ca","abstract_canon_sha256":"4ce09dfc5b9eac75c88eedd2665b961f5c856db2fd251339228a42dd887d2a10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:49.968619Z","signature_b64":"DjOq4TE5YiwytJuI5dqdmL4pbe65rFm0KwYXLC58LDnFeIafKkg3HoxaG0Hwal28ecty1mwAXslkxNgjmrJfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37a2539df8d7529d95ded600b9af8b1cfe1a9c932e305a96de1dfd0a45b0ef2","last_reissued_at":"2026-05-18T00:31:49.967851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:49.967851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properties of the Fibonacci-sum graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrii Arman, David S. Gunderson, Pak Ching Li","submitted_at":"2017-10-27T18:55:55Z","abstract_excerpt":"For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian paths in each $G_n$ have been classified. In this paper, it is shown that each $G_n$ has at most one non-trivial automorphism, which is given explicitly. Other properties of $G_n$ are also found, including the degree sequence, the treewidth, the nature of the bipartition, and that $G_n$ is outerplanar."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10303","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":"1710.10303","created_at":"2026-05-18T00:31:49.967987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10303v1","created_at":"2026-05-18T00:31:49.967987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10303","created_at":"2026-05-18T00:31:49.967987+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N5CKOO7RV2S","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N5CKOO7RV2STWK5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N5CKOO7","created_at":"2026-05-18T12:31:00.734936+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/4N5CKOO7RV2STWK55VQAXGXYWH","json":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH.json","graph_json":"https://pith.science/api/pith-number/4N5CKOO7RV2STWK55VQAXGXYWH/graph.json","events_json":"https://pith.science/api/pith-number/4N5CKOO7RV2STWK55VQAXGXYWH/events.json","paper":"https://pith.science/paper/4N5CKOO7"},"agent_actions":{"view_html":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH","download_json":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH.json","view_paper":"https://pith.science/paper/4N5CKOO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10303&json=true","fetch_graph":"https://pith.science/api/pith-number/4N5CKOO7RV2STWK55VQAXGXYWH/graph.json","fetch_events":"https://pith.science/api/pith-number/4N5CKOO7RV2STWK55VQAXGXYWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH/action/storage_attestation","attest_author":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH/action/author_attestation","sign_citation":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH/action/citation_signature","submit_replication":"https://pith.science/pith/4N5CKOO7RV2STWK55VQAXGXYWH/action/replication_record"}},"created_at":"2026-05-18T00:31:49.967987+00:00","updated_at":"2026-05-18T00:31:49.967987+00:00"}